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.
Sets are complete characteristic-bit codes with actual finite cardinality witnesses. The proof constructs translations and the sumset; no finite-choice oracle, supplied cardinality conclusion, or unproved polynomial-method premise is used.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ d. ∀ e. ∀ u. ∀ v. ∀ p. ∀ t. ∀ h. ∀ r. (∀ x. Lt(x,p) → (BetaAt(u,v,x,1) → BetaAt(d,e,x,1) ∧ (∃ y. ModularSetMember(b,c,p,y) ∧ ModEq(p,x + t,y))) ∧ (BetaAt(d,e,x,1) ∧ (∃ y. ModularSetMember(b,c,p,y) ∧ ModEq(p,x + t,y)) → BetaAt(u,v,x,1))) → ModularTranslationBoundary(b,c,p,h,t,r) → Lt(h,p) → ¬BetaAt(u,v,h,1)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 56 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
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
02Fix variables and assumptionsL11–14
03Separate the logical casesL15–17
04Establish heL18–21
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hlower.
- L18
have he : (BetaAt(u,v,h,1) → BetaAt(d,e,h,1) ∧ (∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,h + t,x))) ∧ (BetaAt(d,e,h,1) ∧ (∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,h + t,x)) → BetaAt(u,v,h,1))Definitions: BetaAt(u,v,h,1)BetaAt(d,e,h,1)ModularSetMember(b,c,p,x)ModEq(p,h + t,x)Original native command in the exact edition - L19
specialize hlower h - L20
apply hlower - L21
exact hh
05Separate the logical casesL22–22
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L22
cases he
06Establish hbothL23–25
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply he left.
- L23
have hboth : BetaAt(d,e,h,1) ∧ (∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,h + t,x))Definitions: BetaAt(d,e,h,1)ModularSetMember(b,c,p,x)ModEq(p,h + t,x)Original native command in the exact edition - L24
apply he_left - L25
exact hmember
07Separate the logical casesL26–29
08Establish heqL30–39
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mod eq bounded unique.
- L30
have heq : x=r - L31
specialize mod_eq_bounded_unique p - L32
specialize mod_eq_bounded_unique x - L33
specialize mod_eq_bounded_unique r - L34
apply mod_eq_bounded_unique - L35
exact hboth_right_witness_left_left - L36
exact hboundary_right_left - L37
specialize mod_eq_trans p - L38
specialize mod_eq_trans x - L39
specialize mod_eq_trans h+t
09Use earlier factsL40–46
10Establish hcommL47–56
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply add comm.
- L47
have hcomm : h+t=t+h - L48
specialize add_comm h - L49
specialize add_comm t - L50
apply add_comm - L51
rewrite hcomm - L52
exact hboundary_right_right_left - L53
apply hboundary_right_right_right - L54
rewrite heq at hboth_right_witness_left_right - L55
rewrite heq at hboth_right_witness_left_right - L56
exact hboth_right_witness_left_right
Original defined command ledger · 56 lines
- 0001
intro b - 0002
intro c - 0003
intro d - 0004
intro e - 0005
intro u - 0006
intro v - 0007
intro p - 0008
intro t - 0009
intro h - 0010
intro r - 0011
intro hlower - 0012
intro hboundary - 0013
intro hh - 0014
intro hmember - 0015
cases hboundary - 0016
cases hboundary_right - 0017
cases hboundary_right_right - 0018
have he : (BetaAt(u,v,h,1) → BetaAt(d,e,h,1) ∧ (∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,h + t,x))) ∧ (BetaAt(d,e,h,1) ∧ (∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,h + t,x)) → BetaAt(u,v,h,1)) - 0019
specialize hlower h - 0020
apply hlower - 0021
exact hh - 0022
cases he - 0023
have hboth : BetaAt(d,e,h,1) ∧ (∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,h + t,x)) - 0024
apply he_left - 0025
exact hmember - 0026
cases hboth - 0027
cases hboth_right - 0028
cases hboth_right_witness - 0029
cases hboth_right_witness_left - 0030
have heq : x=r - 0031
specialize mod_eq_bounded_unique p - 0032
specialize mod_eq_bounded_unique x - 0033
specialize mod_eq_bounded_unique r - 0034
apply mod_eq_bounded_unique - 0035
exact hboth_right_witness_left_left - 0036
exact hboundary_right_left - 0037
specialize mod_eq_trans p - 0038
specialize mod_eq_trans x - 0039
specialize mod_eq_trans h+t - 0040
specialize mod_eq_trans r - 0041
apply mod_eq_trans - 0042
specialize mod_eq_symm p - 0043
specialize mod_eq_symm h+t - 0044
specialize mod_eq_symm x - 0045
apply mod_eq_symm - 0046
exact hboth_right_witness_right - 0047
have hcomm : h+t=t+h - 0048
specialize add_comm h - 0049
specialize add_comm t - 0050
apply add_comm - 0051
rewrite hcomm - 0052
exact hboundary_right_right_left - 0053
apply hboundary_right_right_right - 0054
rewrite heq at hboth_right_witness_left_right - 0055
rewrite heq at hboth_right_witness_left_right - 0056
exact hboth_right_witness_left_right