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
S x ≤ S (S i · c) ∧ (∃ y. b = y · S (S i · c) + x)
Only definitions earlier in this acyclic notation graph are used here.
Hygienic expanded first-order definition
((exists ff_h_defined_beta_at. ff_h_defined_beta_at + S (x) = S ((S (i)) * c)) /\ exists ff_q_defined_beta_at. b = ff_q_defined_beta_at * S ((S (i)) * c) + (x))
The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.
Direct definition dependencies
none — first-order arithmetic only
Definitions depending on this notation
Checked theorems using this definition
SS0001 · divisor_signed_table_at_from_componentsSS0002 · divisor_signed_table_at_to_componentsSS0003 · divisor_signed_table_from_componentsSS0006 · divisor_signed_table_lookupSS0007 · divisor_signed_table_at_functionalSS0012 · divisor_natural_sum_successor_introSS0013 · divisor_signed_table_equality_component_balanceSS0016 · divisor_signed_sum_successor_introSS0017 · divisor_signed_sum_successor_decomposeSS0019 · divisor_signed_table_reindex_data_existsSS001A · divisor_signed_table_reindex_from_componentsSS001B · divisor_signed_table_reindex_existsSS001C · divisor_signed_table_reindex_functionalSS001D · divisor_signed_sum_component_reindexSS001E · divisor_signed_sum_permutation_invariant