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.
The carry relation contains actual quotient columns and carry bits, not the desired valuation. The theorem includes all finite lists and zero parts. It uses sequential binary-column carries; a separate simultaneous-grid or permutation-invariance theorem is not asserted.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ l. ∀ n. ∀ z. Multinomial(b,c,l,n,z) → ¬z = 0
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 29 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
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–7
02Separate the logical casesL8–13
03Use earlier factsL14–23
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L14
specialize crt_positive_moduli_prefix_product_nonzero x2 - L15
specialize crt_positive_moduli_prefix_product_nonzero x3 - L16
specialize crt_positive_moduli_prefix_product_nonzero l - L17
specialize crt_positive_moduli_prefix_product_nonzero z - L18
apply crt_positive_moduli_prefix_product_nonzero - L19
specialize multinomial_binomial_prefix_nonzero b - L20
specialize multinomial_binomial_prefix_nonzero c - L21
specialize multinomial_binomial_prefix_nonzero x - L22
specialize multinomial_binomial_prefix_nonzero x1 - L23
specialize multinomial_binomial_prefix_nonzero x2
04Use earlier factsL24–29
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 29 lines
- 0001
intro b - 0002
intro c - 0003
intro l - 0004
intro n - 0005
intro z - 0006
intro h - 0007
intro hzero - 0008
cases h - 0009
cases h_witness - 0010
cases h_witness_witness - 0011
cases h_witness_witness_witness - 0012
cases h_witness_witness_witness_witness - 0013
cases h_witness_witness_witness_witness_right - 0014
specialize crt_positive_moduli_prefix_product_nonzero x2 - 0015
specialize crt_positive_moduli_prefix_product_nonzero x3 - 0016
specialize crt_positive_moduli_prefix_product_nonzero l - 0017
specialize crt_positive_moduli_prefix_product_nonzero z - 0018
apply crt_positive_moduli_prefix_product_nonzero - 0019
specialize multinomial_binomial_prefix_nonzero b - 0020
specialize multinomial_binomial_prefix_nonzero c - 0021
specialize multinomial_binomial_prefix_nonzero x - 0022
specialize multinomial_binomial_prefix_nonzero x1 - 0023
specialize multinomial_binomial_prefix_nonzero x2 - 0024
specialize multinomial_binomial_prefix_nonzero x3 - 0025
specialize multinomial_binomial_prefix_nonzero l - 0026
apply multinomial_binomial_prefix_nonzero - 0027
exact h_witness_witness_witness_witness_right_left - 0028
exact h_witness_witness_witness_witness_right_right - 0029
exact hzero