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 first-order arithmetic statement
forall a b u U v V E F. ((((u * V + 1 = U * v) /\ ((a * v = b * u + E) /\ (b * U = a * V + F)))) \/ (((U * v + 1 = u * V) /\ ((b * u = a * v + E) /\ (a * V = b * U + F))))) -> (((a * v) = (b * u) + (E)) \/ ((b * u) = (a * v) + (E)))Constructive proof overview
Generated structural guide
The invariant's current error is exactly the absolute cross-product error, including the zero terminal value.
The unchanged tactic script uses 0 declared prerequisites and contains 18 exact native proof lines.
Alpha v34 checked-use · first admitted v29 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply 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.
01Fix variables and assumptionsL1–9
02Separate the logical casesL10–13
03Use earlier factsL14–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L14
exact hi_left_right_left
04Separate the logical casesL15–17
05Use earlier factsL18–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
exact hi_right_right_left