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
Lt(i,r) ∧ s = i ∨ Le(r,i) ∧ s = S iOnly definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
(((exists ff_gap_mdm_lt_research_before. ff_gap_mdm_lt_research_before + S (i) = (r)) /\ s = i) \/ ((exists ff_gap_mdm_le_research_after. ff_gap_mdm_le_research_after + (r) = (i)) /\ s = S i))The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.