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 g. ((((exists ec_gcd_left_gfull_zero_right. a = g * ec_gcd_left_gfull_zero_right) /\ (exists ec_gcd_right_gfull_zero_right. 0 = g * ec_gcd_right_gfull_zero_right)) /\ forall ec_gcd_common_gfull_zero_right. (exists ec_gcd_common_left_gfull_zero_right. a = ec_gcd_common_gfull_zero_right * ec_gcd_common_left_gfull_zero_right) -> (exists ec_gcd_common_right_gfull_zero_right. 0 = ec_gcd_common_gfull_zero_right * ec_gcd_common_right_gfull_zero_right) -> exists ec_gcd_greatest_gfull_zero_right. g = ec_gcd_common_gfull_zero_right * ec_gcd_greatest_gfull_zero_right)) -> g = aConstructive proof overview
Generated structural guide
A relational gcd with zero on the right equals its other input.
The unchanged tactic script uses 1 declared prerequisite and contains 8 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
canonical_gcd_zero_right_iff Alpha theorem; checked-use authorizedDirect 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–3
02Use earlier factsL4–5
03Separate the logical casesL6–6
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L6
cases canonical_gcd_zero_right_iff