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
q = 0 ∧ Le(L,d) ∨ ¬q = 0 ∧ q + d = L
Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
(((((q))=0) /\ ((exists pfc_gap_working_euclidean_definitionshort. pfc_gap_working_euclidean_definitionshort+((L))=((d)))))) \/ (((~(((q))=0)) /\ ((((q))+((d))=((L))))))
The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.
Direct definition dependencies
Definitions depending on this notation
Checked theorems using this definition
none directly; see definition consumers