Exact expanded PA statement
forall q b c l. (forall eis_index_initial_segment_extend_before. (exists eis_lt_gap_initial_segment_extend_before_bound. eis_lt_gap_initial_segment_extend_before_bound + S (eis_index_initial_segment_extend_before) = l) -> exists eis_bit_initial_segment_extend_before. ((((exists ff_h_eis_initial_segment_extend_before_decoded. ff_h_eis_initial_segment_extend_before_decoded + S (eis_bit_initial_segment_extend_before) = S ((S (eis_index_initial_segment_extend_before)) * c)) /\ exists ff_q_eis_initial_segment_extend_before_decoded. b = ff_q_eis_initial_segment_extend_before_decoded * S ((S (eis_index_initial_segment_extend_before)) * c) + (eis_bit_initial_segment_extend_before))) /\ (((eis_bit_initial_segment_extend_before = 1 /\ (exists eis_le_gap_initial_segment_extend_before_choice_inside. eis_le_gap_initial_segment_extend_before_choice_inside + (S eis_index_initial_segment_extend_before) = q)) \/ (eis_bit_initial_segment_extend_before = 0 /\ (exists eis_lt_gap_initial_segment_extend_before_choice_outside. eis_lt_gap_initial_segment_extend_before_choice_outside + S (q) = S eis_index_initial_segment_extend_before)))))) -> (exists bit. (((bit = 1 /\ (exists eis_le_gap_initial_segment_extend_last_inside. eis_le_gap_initial_segment_extend_last_inside + (S l) = q)) \/ (bit = 0 /\ (exists eis_lt_gap_initial_segment_extend_last_outside. eis_lt_gap_initial_segment_extend_last_outside + S (q) = S l))))) -> exists z d. (forall eis_index_initial_segment_extend_after. (exists eis_lt_gap_initial_segment_extend_after_bound. eis_lt_gap_initial_segment_extend_after_bound + S (eis_index_initial_segment_extend_after) = S l) -> exists eis_bit_initial_segment_extend_after. ((((exists ff_h_eis_initial_segment_extend_after_decoded. ff_h_eis_initial_segment_extend_after_decoded + S (eis_bit_initial_segment_extend_after) = S ((S (eis_index_initial_segment_extend_after)) * d)) /\ exists ff_q_eis_initial_segment_extend_after_decoded. z = ff_q_eis_initial_segment_extend_after_decoded * S ((S (eis_index_initial_segment_extend_after)) * d) + (eis_bit_initial_segment_extend_after))) /\ (((eis_bit_initial_segment_extend_after = 1 /\ (exists eis_le_gap_initial_segment_extend_after_choice_inside. eis_le_gap_initial_segment_extend_after_choice_inside + (S eis_index_initial_segment_extend_after) = q)) \/ (eis_bit_initial_segment_extend_after = 0 /\ (exists eis_lt_gap_initial_segment_extend_after_choice_outside. eis_lt_gap_initial_segment_extend_after_choice_outside + S (q) = S eis_index_initial_segment_extend_after))))))Structural proof guide
Append one exact threshold bit while preserving the old prefix.
Direct prerequisites: beta_prefix_extend, finite_lt_succ_eq_or_lt. The authored body proceeds by case analysis (7), intermediate claims (2), equality transport (4).
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 q - 0002
intro b - 0003
intro c - 0004
intro l - 0005
intro hprefix - 0006
intro hchoice - 0007
cases hchoice - 0008
specialize beta_prefix_extend l - 0009
specialize beta_prefix_extend b - 0010
specialize beta_prefix_extend c - 0011
specialize beta_prefix_extend x - 0012
cases beta_prefix_extend - 0013
cases beta_prefix_extend_witness - 0014
cases beta_prefix_extend_witness_witness - 0015
exists x1 - 0016
exists x2 - 0017
intro j - 0018
intro hj - 0019
have hsplit : j = l \/ exists gap. gap + S j = l - 0020
specialize finite_lt_succ_eq_or_lt l - 0021
specialize finite_lt_succ_eq_or_lt j - 0022
apply finite_lt_succ_eq_or_lt - 0023
exact hj - 0024
cases hsplit - 0025
exists x - 0026
split - 0027
rewrite hsplit_left - 0028
rewrite hsplit_left - 0029
exact beta_prefix_extend_witness_witness_left - 0030
rewrite hsplit_left - 0031
rewrite hsplit_left - 0032
exact hchoice_witness - 0033
have hold : exists oldbit. ((((exists ff_h_initial_segment_old. ff_h_initial_segment_old + S (oldbit) = S ((S (j)) * c)) /\ exists ff_q_initial_segment_old. b = ff_q_initial_segment_old * S ((S (j)) * c) + (oldbit))) /\ (((oldbit = 1 /\ (exists eis_le_gap_initial_segment_extend_old_choice_inside. eis_le_gap_initial_segment_extend_old_choice_inside + (S j) = q)) \/ (oldbit = 0 /\ (exists eis_lt_gap_initial_segment_extend_old_choice_outside. eis_lt_gap_initial_segment_extend_old_choice_outside + S (q) = S j))))) - 0034
specialize hprefix j - 0035
apply hprefix - 0036
exact hsplit_right - 0037
cases hold - 0038
cases hold_witness - 0039
exists x3 - 0040
split - 0041
specialize beta_prefix_extend_witness_witness_right j - 0042
specialize beta_prefix_extend_witness_witness_right x3 - 0043
apply beta_prefix_extend_witness_witness_right - 0044
exact hsplit_right - 0045
exact hold_witness_left - 0046
exact hold_witness_right