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
∃ sb_pos_lowerlayer. ∃ sb_neg_lowerlayer. SignedDecode(z,sb_pos_lowerlayer,sb_neg_lowerlayer) ∧ p + sb_neg_lowerlayer = n + sb_pos_lowerlayerOnly definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
exists sb_pos_lowerlayer sb_neg_lowerlayer. (((z = 2 * sb_pos_lowerlayer /\ sb_neg_lowerlayer = 0) \/ exists sd_half_lowerlayer. ((z = 2 * sd_half_lowerlayer + 1 /\ sb_pos_lowerlayer = 0) /\ sb_neg_lowerlayer = S sd_half_lowerlayer)) /\ p + sb_neg_lowerlayer = n + sb_pos_lowerlayer)The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.