Exact expanded PA statement
forall a l. exists b c. (forall bpr_index_bpifpx_result. (exists bpr_gap_bpifpx_result_bound. bpr_gap_bpifpx_result_bound + S (bpr_index_bpifpx_result) = l) -> exists bpr_value_bpifpx_result. ((((exists bpr_height_bpifpx_result_decoded. bpr_height_bpifpx_result_decoded + S (bpr_value_bpifpx_result) = S ((S (bpr_index_bpifpx_result)) * c)) /\ exists bpr_quotient_bpifpx_result_decoded. b = bpr_quotient_bpifpx_result_decoded * S ((S (bpr_index_bpifpx_result)) * c) + (bpr_value_bpifpx_result))) /\ (((((~(S (a + bpr_index_bpifpx_result) = 1) /\ forall bpr_left_bpifpx_result_choice_prime bpr_right_bpifpx_result_choice_prime. S (a + bpr_index_bpifpx_result) = bpr_left_bpifpx_result_choice_prime * bpr_right_bpifpx_result_choice_prime -> bpr_left_bpifpx_result_choice_prime = 1 \/ bpr_right_bpifpx_result_choice_prime = 1)) /\ bpr_value_bpifpx_result = S (a + bpr_index_bpifpx_result)) \/ (~((~(S (a + bpr_index_bpifpx_result) = 1) /\ forall bpr_left_bpifpx_result_choice_prime bpr_right_bpifpx_result_choice_prime. S (a + bpr_index_bpifpx_result) = bpr_left_bpifpx_result_choice_prime * bpr_right_bpifpx_result_choice_prime -> bpr_left_bpifpx_result_choice_prime = 1 \/ bpr_right_bpifpx_result_choice_prime = 1)) /\ bpr_value_bpifpx_result = 1)))))Structural proof guide
Every offset and length has a beta-coded selector interval.
Direct prerequisites: add_eq_zero_right, succ_ne_zero, primorial_interval_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
intro a - 0002
induction l - 0003
exists 0 - 0004
exists 0 - 0005
intro i - 0006
intro hi - 0007
exfalso - 0008
cases hi - 0009
have hsi : S i = 0 - 0010
apply add_eq_zero_right - 0011
exact hi_witness - 0012
apply succ_ne_zero - 0013
exact hsi - 0014
have hprevious : exists b c. (forall bpr_index_bpifpx_previous. (exists bpr_gap_bpifpx_previous_bound. bpr_gap_bpifpx_previous_bound + S (bpr_index_bpifpx_previous) = l) -> exists bpr_value_bpifpx_previous. ((((exists bpr_height_bpifpx_previous_decoded. bpr_height_bpifpx_previous_decoded + S (bpr_value_bpifpx_previous) = S ((S (bpr_index_bpifpx_previous)) * c)) /\ exists bpr_quotient_bpifpx_previous_decoded. b = bpr_quotient_bpifpx_previous_decoded * S ((S (bpr_index_bpifpx_previous)) * c) + (bpr_value_bpifpx_previous))) /\ (((((~(S (a + bpr_index_bpifpx_previous) = 1) /\ forall bpr_left_bpifpx_previous_choice_prime bpr_right_bpifpx_previous_choice_prime. S (a + bpr_index_bpifpx_previous) = bpr_left_bpifpx_previous_choice_prime * bpr_right_bpifpx_previous_choice_prime -> bpr_left_bpifpx_previous_choice_prime = 1 \/ bpr_right_bpifpx_previous_choice_prime = 1)) /\ bpr_value_bpifpx_previous = S (a + bpr_index_bpifpx_previous)) \/ (~((~(S (a + bpr_index_bpifpx_previous) = 1) /\ forall bpr_left_bpifpx_previous_choice_prime bpr_right_bpifpx_previous_choice_prime. S (a + bpr_index_bpifpx_previous) = bpr_left_bpifpx_previous_choice_prime * bpr_right_bpifpx_previous_choice_prime -> bpr_left_bpifpx_previous_choice_prime = 1 \/ bpr_right_bpifpx_previous_choice_prime = 1)) /\ bpr_value_bpifpx_previous = 1))))) - 0015
exact IH - 0016
cases hprevious - 0017
cases hprevious_witness - 0018
have hnext : exists b c. (forall bpr_index_bpifpx_successor. (exists bpr_gap_bpifpx_successor_bound. bpr_gap_bpifpx_successor_bound + S (bpr_index_bpifpx_successor) = S l) -> exists bpr_value_bpifpx_successor. ((((exists bpr_height_bpifpx_successor_decoded. bpr_height_bpifpx_successor_decoded + S (bpr_value_bpifpx_successor) = S ((S (bpr_index_bpifpx_successor)) * c)) /\ exists bpr_quotient_bpifpx_successor_decoded. b = bpr_quotient_bpifpx_successor_decoded * S ((S (bpr_index_bpifpx_successor)) * c) + (bpr_value_bpifpx_successor))) /\ (((((~(S (a + bpr_index_bpifpx_successor) = 1) /\ forall bpr_left_bpifpx_successor_choice_prime bpr_right_bpifpx_successor_choice_prime. S (a + bpr_index_bpifpx_successor) = bpr_left_bpifpx_successor_choice_prime * bpr_right_bpifpx_successor_choice_prime -> bpr_left_bpifpx_successor_choice_prime = 1 \/ bpr_right_bpifpx_successor_choice_prime = 1)) /\ bpr_value_bpifpx_successor = S (a + bpr_index_bpifpx_successor)) \/ (~((~(S (a + bpr_index_bpifpx_successor) = 1) /\ forall bpr_left_bpifpx_successor_choice_prime bpr_right_bpifpx_successor_choice_prime. S (a + bpr_index_bpifpx_successor) = bpr_left_bpifpx_successor_choice_prime * bpr_right_bpifpx_successor_choice_prime -> bpr_left_bpifpx_successor_choice_prime = 1 \/ bpr_right_bpifpx_successor_choice_prime = 1)) /\ bpr_value_bpifpx_successor = 1))))) - 0019
apply primorial_interval_factor_prefix_extend - 0020
exact hprevious_witness_witness - 0021
exact hnext