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
∀ d. ∀ a. ∀ b. ∀ c. ModEq(d,a + b,a + c) → ModEq(d,b,c)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
2 occurrences
In local proof propositions
0 occurrences
Exact expanded native-PA statement
forall d a b c. (exists fspm_u_cancel_input fspm_v_cancel_input. (a + b) + d * fspm_u_cancel_input = (a + c) + d * fspm_v_cancel_input) -> (exists fspm_u_cancel_result fspm_v_cancel_result. (b) + d * fspm_u_cancel_result = (c) + d * fspm_v_cancel_result)Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-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–5
02Separate the logical casesL6–7
03Construct an explicit witnessL8–9
04Use earlier factsL10–13
05Calculate and transport equalitiesL14–15
06Use earlier factsL16–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L16
apply add_assoc
07Calculate and transport equalitiesL17–17
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L17
trans (a + c) + d * x1
Original defined command ledger · 19 lines
- 0001
intro d - 0002
intro a - 0003
intro b - 0004
intro c - 0005
intro hmod - 0006
cases hmod - 0007
cases hmod_witness - 0008
exists x - 0009
exists x1 - 0010
specialize add_left_cancel a - 0011
specialize add_left_cancel (b + d * x) - 0012
specialize add_left_cancel (c + d * x1) - 0013
apply add_left_cancel - 0014
trans (a + b) + d * x - 0015
symm - 0016
apply add_assoc - 0017
trans (a + c) + d * x1 - 0018
exact hmod_witness_witness - 0019
apply add_assoc