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.
Statement with defined notation
∀ m. ∀ n. ¬m = 0 → ∃ x. ∃ y. DivRem(n,m,x,y)Every purple notation token opens its conservative definition. This is a reading surface; the compiler expands the statement before the unchanged kernel checks it.
Definitions used by this theorem
In the theorem statement
1 occurrences
In local proof propositions
0 occurrences
Exact expanded native-PA statement
forall m n. ~(m = 0) -> exists q r. n = m * q + r /\ S r <= mProof neighborhood
Direct theorem prerequisites
Direct theorem dependents
PA001K gcd_balanced_bezout_exists_up_to PA0029 beta_at_exists PA002V mod_eq_to_remainder_decomposition PA0035 gcd_exists_up_to PA005K mod_eq_decidable_nonzero PA005R quadratic_residue_bounded_equiv PA0063 prime_bounded_nonzero_mod_inverse PA0072 gauss_half_range_signed_choices PA0086 nondivisor_canonical_remainder_exists PA008B prime_mul_index_map_exists_up_to PA008Q prime_scaled_inverse_exists PA00BY beta_division_prefix_existsDefinition-aware tactic body
Only local propositions introduced by have or suffices are compacted. The untrusted compiler re-expands each one before the original tactic script is replayed; defined notation is never accepted by the kernel. Open the exact replay line beneath every changed command.
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 (2)
01Fix variables and assumptionsL1–3
02Use earlier factsL4–4
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L4
specialize zero_or_succ m
03Separate the logical casesL5–6
04Use earlier factsL7–8
05Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
cases zero_or_succ_right
06Use earlier factsL10–11
07Calculate and transport equalitiesL12–13
08Use earlier factsL14–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L14
exact division_remainder_succ
Original defined command ledger · 14 lines
- 0001
intro m - 0002
intro n - 0003
intro hm - 0004
specialize zero_or_succ m - 0005
cases zero_or_succ - 0006
exfalso - 0007
apply hm - 0008
exact zero_or_succ_left - 0009
cases zero_or_succ_right - 0010
specialize division_remainder_succ x - 0011
specialize division_remainder_succ n - 0012
rewrite zero_or_succ_right_witness - 0013
rewrite zero_or_succ_right_witness - 0014
exact division_remainder_succ