Exact expanded PA statement
forall m. exists b c. (forall bpr_index_bpfpx_result. (exists bpr_gap_bpfpx_result_bound. bpr_gap_bpfpx_result_bound + S (bpr_index_bpfpx_result) = m) -> exists bpr_value_bpfpx_result. ((((exists bpr_height_bpfpx_result_decoded. bpr_height_bpfpx_result_decoded + S (bpr_value_bpfpx_result) = S ((S (bpr_index_bpfpx_result)) * c)) /\ exists bpr_quotient_bpfpx_result_decoded. b = bpr_quotient_bpfpx_result_decoded * S ((S (bpr_index_bpfpx_result)) * c) + (bpr_value_bpfpx_result))) /\ (((((~(S (bpr_index_bpfpx_result) = 1) /\ forall bpr_left_bpfpx_result_choice_prime bpr_right_bpfpx_result_choice_prime. S (bpr_index_bpfpx_result) = bpr_left_bpfpx_result_choice_prime * bpr_right_bpfpx_result_choice_prime -> bpr_left_bpfpx_result_choice_prime = 1 \/ bpr_right_bpfpx_result_choice_prime = 1)) /\ bpr_value_bpfpx_result = S (bpr_index_bpfpx_result)) \/ (~((~(S (bpr_index_bpfpx_result) = 1) /\ forall bpr_left_bpfpx_result_choice_prime bpr_right_bpfpx_result_choice_prime. S (bpr_index_bpfpx_result) = bpr_left_bpfpx_result_choice_prime * bpr_right_bpfpx_result_choice_prime -> bpr_left_bpfpx_result_choice_prime = 1 \/ bpr_right_bpfpx_result_choice_prime = 1)) /\ bpr_value_bpfpx_result = 1)))))Structural proof guide
Every finite length has a beta-coded selector prefix.
Direct prerequisites: add_eq_zero_right, succ_ne_zero, primorial_factor_prefix_extend. The authored body proceeds by structural induction (1), case analysis (3), intermediate claims (3).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.
- 0001
induction m - 0002
exists 0 - 0003
exists 0 - 0004
intro i - 0005
intro hi - 0006
exfalso - 0007
cases hi - 0008
have hsi : S i = 0 - 0009
apply add_eq_zero_right - 0010
exact hi_witness - 0011
apply succ_ne_zero - 0012
exact hsi - 0013
have hprevious : exists b c. (forall bpr_index_bpfpx_previous. (exists bpr_gap_bpfpx_previous_bound. bpr_gap_bpfpx_previous_bound + S (bpr_index_bpfpx_previous) = m) -> exists bpr_value_bpfpx_previous. ((((exists bpr_height_bpfpx_previous_decoded. bpr_height_bpfpx_previous_decoded + S (bpr_value_bpfpx_previous) = S ((S (bpr_index_bpfpx_previous)) * c)) /\ exists bpr_quotient_bpfpx_previous_decoded. b = bpr_quotient_bpfpx_previous_decoded * S ((S (bpr_index_bpfpx_previous)) * c) + (bpr_value_bpfpx_previous))) /\ (((((~(S (bpr_index_bpfpx_previous) = 1) /\ forall bpr_left_bpfpx_previous_choice_prime bpr_right_bpfpx_previous_choice_prime. S (bpr_index_bpfpx_previous) = bpr_left_bpfpx_previous_choice_prime * bpr_right_bpfpx_previous_choice_prime -> bpr_left_bpfpx_previous_choice_prime = 1 \/ bpr_right_bpfpx_previous_choice_prime = 1)) /\ bpr_value_bpfpx_previous = S (bpr_index_bpfpx_previous)) \/ (~((~(S (bpr_index_bpfpx_previous) = 1) /\ forall bpr_left_bpfpx_previous_choice_prime bpr_right_bpfpx_previous_choice_prime. S (bpr_index_bpfpx_previous) = bpr_left_bpfpx_previous_choice_prime * bpr_right_bpfpx_previous_choice_prime -> bpr_left_bpfpx_previous_choice_prime = 1 \/ bpr_right_bpfpx_previous_choice_prime = 1)) /\ bpr_value_bpfpx_previous = 1))))) - 0014
exact IH - 0015
cases hprevious - 0016
cases hprevious_witness - 0017
have hnext : exists b c. (forall bpr_index_bpfpx_successor. (exists bpr_gap_bpfpx_successor_bound. bpr_gap_bpfpx_successor_bound + S (bpr_index_bpfpx_successor) = S m) -> exists bpr_value_bpfpx_successor. ((((exists bpr_height_bpfpx_successor_decoded. bpr_height_bpfpx_successor_decoded + S (bpr_value_bpfpx_successor) = S ((S (bpr_index_bpfpx_successor)) * c)) /\ exists bpr_quotient_bpfpx_successor_decoded. b = bpr_quotient_bpfpx_successor_decoded * S ((S (bpr_index_bpfpx_successor)) * c) + (bpr_value_bpfpx_successor))) /\ (((((~(S (bpr_index_bpfpx_successor) = 1) /\ forall bpr_left_bpfpx_successor_choice_prime bpr_right_bpfpx_successor_choice_prime. S (bpr_index_bpfpx_successor) = bpr_left_bpfpx_successor_choice_prime * bpr_right_bpfpx_successor_choice_prime -> bpr_left_bpfpx_successor_choice_prime = 1 \/ bpr_right_bpfpx_successor_choice_prime = 1)) /\ bpr_value_bpfpx_successor = S (bpr_index_bpfpx_successor)) \/ (~((~(S (bpr_index_bpfpx_successor) = 1) /\ forall bpr_left_bpfpx_successor_choice_prime bpr_right_bpfpx_successor_choice_prime. S (bpr_index_bpfpx_successor) = bpr_left_bpfpx_successor_choice_prime * bpr_right_bpfpx_successor_choice_prime -> bpr_left_bpfpx_successor_choice_prime = 1 \/ bpr_right_bpfpx_successor_choice_prime = 1)) /\ bpr_value_bpfpx_successor = 1))))) - 0018
apply primorial_factor_prefix_extend - 0019
exact hprevious_witness_witness - 0020
exact hnext