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. ∀ s. Le(a,s) → Le(a · a,s · s)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 s. (exists ftsp_weak_square_source. ftsp_weak_square_source + (a) = s) -> (exists ftsp_weak_square_result. ftsp_weak_square_result + (a * a) = s * s)Proof 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
02Establish hfirstL4–9
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mul le mul right.
- L4
have hfirst : Le(a · a,s · a)Definitions: Le(a · a,s · a)Original native command in the exact edition - L5
specialize mul_le_mul_right a - L6
specialize mul_le_mul_right s - L7
specialize mul_le_mul_right a - L8
apply mul_le_mul_right - L9
exact hle
03Establish hsecondL10–19
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mul le mul left.
- L10
have hsecond : Le(s · a,s · s)Definitions: Le(s · a,s · s)Original native command in the exact edition - L11
specialize mul_le_mul_left a - L12
specialize mul_le_mul_left s - L13
specialize mul_le_mul_left s - L14
apply mul_le_mul_left - L15
exact hle - L16
specialize le_trans (a * a) - L17
specialize le_trans (s * a) - L18
specialize le_trans (s * s) - L19
apply le_trans
Original defined command ledger · 21 lines
- 0001
intro a - 0002
intro s - 0003
intro hle - 0004
have hfirst : Le(a · a,s · a)Exact native replay line
have hfirst : exists k. k + a * a = s * a - 0005
specialize mul_le_mul_right a - 0006
specialize mul_le_mul_right s - 0007
specialize mul_le_mul_right a - 0008
apply mul_le_mul_right - 0009
exact hle - 0010
have hsecond : Le(s · a,s · s)Exact native replay line
have hsecond : exists k. k + s * a = s * s - 0011
specialize mul_le_mul_left a - 0012
specialize mul_le_mul_left s - 0013
specialize mul_le_mul_left s - 0014
apply mul_le_mul_left - 0015
exact hle - 0016
specialize le_trans (a * a) - 0017
specialize le_trans (s * a) - 0018
specialize le_trans (s * s) - 0019
apply le_trans - 0020
exact hfirst - 0021
exact hsecond