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.
Exact expanded PA statement
forall n. n <= 0 -> n = 0Structural proof guide
Only zero is less than or equal to zero.
Direct prerequisites: add_eq_zero_right. The authored body proceeds by case analysis (1).
Proof neighborhood
Direct dependencies
Direct dependents
BT002U gcd_exists_up_to BT0034 gcd_balanced_bezout_exists_up_to BT003E factor_search_up_to BT003K prime_divisor_exists_up_to BT0097 lt_three_cases BT00JD eisenstein_initial_segment_bit_count_functional BT00PS bounded_prime_interval_search BT00Q5 bounded_power_valuation_search BT00TM choose_positive BT00VV primorial_le_four_pow_boundedFormal native tactic body
Dependencies are hypotheses of the historical Alpha-v12 body receipt. The complete historical Alpha-v18 proof bundle independently checks every dependency; current Alpha v25 preserves that checked theorem use without changing Stable membership.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
Named ingredients (1)
01Fix variables and assumptionsL1–2
02Separate the logical casesL3–3
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L3
cases h