Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Definition in prerequisite notation
Lt(r,m) ∧ ModEq(m,a,r)Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
((exists ff_gap_binary_advanced. ff_gap_binary_advanced + S (r) = m) /\ (exists ff_left_binary_advanced_congruence ff_right_binary_advanced_congruence. (a) + m * ff_left_binary_advanced_congruence = (r) + m * ff_right_binary_advanced_congruence))The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.