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
∀ k. ∀ a. ∀ e. ModEq(k,a,e) → ModEq(k,a · e,e · e)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 k a e. (exists ftcn_left_fssq_dot_positive_source ftcn_right_fssq_dot_positive_source. (a) + (k) * ftcn_left_fssq_dot_positive_source = (e) + (k) * ftcn_right_fssq_dot_positive_source) -> (exists ftcn_left_fssq_dot_positive_result ftcn_right_fssq_dot_positive_result. (a * e) + (k) * ftcn_left_fssq_dot_positive_result = (e * e) + (k) * ftcn_right_fssq_dot_positive_result)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.