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
¬d = 0 ∧ n = d · q ∨ (d = 0 ∨ ¬Dvd(d,n)) ∧ q = dOnly definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
(((~(((d))=0)) /\ (((n))=((d))*((q))))) \/ (((((d))=0 \/ ~(exists pvs_factor_lowercontinuationnondivisor. ((n)) = ((d)) * pvs_factor_lowercontinuationnondivisor)) /\ (((q))=((d)))))The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.