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.
Definition in prerequisite notation
p + m · t = n + m · q + r ∧ Lt(r,m)Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
((p) + (m) * (t) = ((n) + (m) * (q)) + (r) /\ exists sif_gap_lowerlayer. sif_gap_lowerlayer + S (r) = (m))The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.