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
∀ n. ∀ q. ∀ r. DivRem(n + n,3,q,r) → ∃ x. q + x = n + nEvery purple notation token opens its conservative definition. Expanding the displayed statement recovers the exact first-order Peano-arithmetic formula checked by the unchanged kernel.
Definitions used by this theorem
In the theorem statement
1 occurrences
In local proof propositions
1 occurrences
Exact expanded native-PA statement
forall n q r. (((n + n) = (3) * (q) + (r) /\ (exists bcf_lt_gap_b5rbdqld_division_bound. bcf_lt_gap_b5rbdqld_division_bound + S (r) = 3))) -> exists h. q + h = n + nProof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only local propositions introduced by have or suffices are compacted. Every changed line has an exact-AST conservative-expansion receipt; the kernel still receives the immutable original tactic 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 (2)
01Fix variables and assumptionsL1–4
02Establish hboundL5–10
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply division quotient le dividend.
03Separate the logical casesL11–11
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L11
cases hbound
04Construct an explicit witnessL12–12
Supply the displayed value, then prove that it has the required property.
- L12
exists x
05Use earlier factsL13–14
06Calculate and transport equalitiesL15–15
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L15
rewrite add_comm
07Use earlier factsL16–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
exact hbound_witness
Original defined command ledger · 16 lines
- 0001
intro n - 0002
intro q - 0003
intro r - 0004
intro hdivision - 0005
have hbound : Le(q,n + n)Exact native replay line
have hbound : exists bcf_le_gap_b5rbdqld_result. bcf_le_gap_b5rbdqld_result + (q) = n + n - 0006
specialize division_quotient_le_dividend n - 0007
specialize division_quotient_le_dividend q - 0008
specialize division_quotient_le_dividend r - 0009
apply division_quotient_le_dividend - 0010
exact hdivision - 0011
cases hbound - 0012
exists x - 0013
specialize add_comm q - 0014
specialize add_comm x - 0015
rewrite add_comm - 0016
exact hbound_witness