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.
Statement with defined notation
∀ a. ∀ b. Lt(a · a,b · b) → Lt(a,b)Every purple notation token opens its conservative definition. This reading surface never changes the unchanged intuitionistic kernel or confers checked-use authority.
Definitions used by this theorem
In the theorem statement
In local proof propositions
Exact expanded first-order statement
forall a b. (exists k. k + S (a * a) = b * b) -> exists k. k + S a = bProof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only propositions whose conservative expansion has been checked for exact first-order equivalence are compacted. Every changed line retains its immutable exact replay command.
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–3
02Use earlier factsL4–5
03Separate the logical casesL6–7
04Use earlier factsL8–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 16 lines
- 0001
intro a - 0002
intro b - 0003
intro hlt - 0004
specialize le_or_lt b - 0005
specialize le_or_lt a - 0006
cases le_or_lt - 0007
exfalso - 0008
specialize lt_not_le (a * a) - 0009
specialize lt_not_le (b * b) - 0010
apply lt_not_le - 0011
exact hlt - 0012
specialize natural_square_monotone_expanded b - 0013
specialize natural_square_monotone_expanded a - 0014
apply natural_square_monotone_expanded - 0015
exact le_or_lt_left - 0016
exact le_or_lt_right