Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Exact expanded first-order arithmetic statement
forall b c u v l. (forall mdr_i_symmetric_source mdr_a_symmetric_source. (exists mdr_gap_symmetric_sourceb. mdr_gap_symmetric_sourceb + S (mdr_i_symmetric_source) = (l)) -> (((exists ff_h_mdr_symmetric_sourceo. ff_h_mdr_symmetric_sourceo + S (mdr_a_symmetric_source) = S ((S (mdr_i_symmetric_source)) * c)) /\ exists ff_q_mdr_symmetric_sourceo. b = ff_q_mdr_symmetric_sourceo * S ((S (mdr_i_symmetric_source)) * c) + (mdr_a_symmetric_source))) -> (((exists ff_h_mdr_symmetric_sourcen. ff_h_mdr_symmetric_sourcen + S (mdr_a_symmetric_source) = S ((S (mdr_i_symmetric_source)) * v)) /\ exists ff_q_mdr_symmetric_sourcen. u = ff_q_mdr_symmetric_sourcen * S ((S (mdr_i_symmetric_source)) * v) + (mdr_a_symmetric_source)))) -> (forall mdr_i_symmetric_result mdr_a_symmetric_result. (exists mdr_gap_symmetric_resultb. mdr_gap_symmetric_resultb + S (mdr_i_symmetric_result) = (l)) -> (((exists ff_h_mdr_symmetric_resulto. ff_h_mdr_symmetric_resulto + S (mdr_a_symmetric_result) = S ((S (mdr_i_symmetric_result)) * v)) /\ exists ff_q_mdr_symmetric_resulto. u = ff_q_mdr_symmetric_resulto * S ((S (mdr_i_symmetric_result)) * v) + (mdr_a_symmetric_result))) -> (((exists ff_h_mdr_symmetric_resultn. ff_h_mdr_symmetric_resultn + S (mdr_a_symmetric_result) = S ((S (mdr_i_symmetric_result)) * c)) /\ exists ff_q_mdr_symmetric_resultn. b = ff_q_mdr_symmetric_resultn * S ((S (mdr_i_symmetric_result)) * c) + (mdr_a_symmetric_result))))Constructive proof overview
Generated structural guide
Finite beta-prefix equality is symmetric because beta decoding is total and functional.
The unchanged tactic script uses 2 declared prerequisites and contains 32 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
beta_at_exists Stable theorem; checked-use authorized beta_at_unique Stable theorem; checked-use authorizedDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
01Fix variables and assumptionsL1–10
02Establish hvalueL11–15
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at exists.
- L11
have hvalue : exists z. ((exists ff_h_mdr_reverse_value. ff_h_mdr_reverse_value + S (z) = S ((S (i)) * c)) /\ exists ff_q_mdr_reverse_value. b = ff_q_mdr_reverse_value * S ((S (i)) * c) + (z)) - L12
specialize beta_at_exists (b) - L13
specialize beta_at_exists (c) - L14
specialize beta_at_exists (i) - L15
apply beta_at_exists
03Separate the logical casesL16–16
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L16
cases hvalue
04Establish heqL17–26
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
05Use earlier factsL27–29
06Calculate and transport equalitiesL30–31
07Use earlier factsL32–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
exact hvalue_witness
Original exact command ledger · 32 lines
- 0001
intro b - 0002
intro c - 0003
intro u - 0004
intro v - 0005
intro l - 0006
intro hprefix - 0007
intro i - 0008
intro a - 0009
intro hi - 0010
intro ha - 0011
have hvalue : exists z. ((exists ff_h_mdr_reverse_value. ff_h_mdr_reverse_value + S (z) = S ((S (i)) * c)) /\ exists ff_q_mdr_reverse_value. b = ff_q_mdr_reverse_value * S ((S (i)) * c) + (z)) - 0012
specialize beta_at_exists (b) - 0013
specialize beta_at_exists (c) - 0014
specialize beta_at_exists (i) - 0015
apply beta_at_exists - 0016
cases hvalue - 0017
have heq : a = x - 0018
specialize beta_at_unique (u) - 0019
specialize beta_at_unique (v) - 0020
specialize beta_at_unique (i) - 0021
specialize beta_at_unique (a) - 0022
specialize beta_at_unique (x) - 0023
apply beta_at_unique - 0024
exact ha - 0025
specialize hprefix (i) - 0026
specialize hprefix (x) - 0027
apply hprefix - 0028
exact hi - 0029
exact hvalue_witness - 0030
rewrite heq - 0031
rewrite heq - 0032
exact hvalue_witness