kernel-Int.ediv_gcd_ne_zero_if_ne_zero_right
- Kind
- kernel-term
- Status
- checked
Supports: ∀ {b : ℤ} (a : ℤ), b ≠ 0 → b / ↑(a.gcd b) ≠ 0
test "$(cargo run -q -p axeyum-lean-kernel --example int_theorem_inventory -- ediv_gcd_ne_zero_if_ne_zero_right 2>/dev/null | /usr/bin/grep -cE '^theorem[[:space:]]+Int\.ediv_gcd_ne_zero_if_ne_zero_right[[:space:]]')" -ge 1 Evidence notes
`build_int_prelude` admits `Int.ediv_gcd_ne_zero_if_ne_zero_right` through the trusted `Kernel::add_declaration` gate, which re-checks the proof term against the stated type, so producing this row at all is a machine-checked proof. New proof, lane int-dvd-mirrors: `int_prelude/dvd_gcd_mirrors.rs`'s `declare_ediv_gcd_ne_zero_if_ne_zero_right`. `c := ofNat (gcd a b)` divides `b` (`gcd_dvd_right`); `c ≠ 0` follows from `b ≠ 0` (if `c = 0` then `c ∣ b` rewrites to `0 ∣ b`, and a local `zero_dvd_elim` forces `b = 0`, contradiction). With `c ≠ 0` and `c ∣ b`, a local copy of `gcd.rs`'s private `exact_general` gives `b = c * (b.ediv c)`; substituting a hypothetical `b.ediv c = 0` collapses the right side to `c * 0 = 0` (`Int.mul_zero`), contradicting `b ≠ 0`. `int_theorem_inventory`'s rendered type matches this fact's `formal.statement` (`∀ {b : ℤ} (a : ℤ), b ≠ 0 → b / ↑(a.gcd b) ≠ 0`). `int_theorem_inventory` exits non-zero for a name that does not exist, and the `grep -c` count (tested `-ge 1`, not piped into `grep -q`) requires the admitted declaration to actually be printed; the anchor requires the exact name followed by whitespace, so it cannot match a longer sibling name sharing the same prefix. Verified both ways: the real name greps to a count `-ge 1`; grepping a fabricated name (`Int.ediv_gcd_ne_zero_if_ne_zero_right_bogus_xyz`) makes `int_theorem_inventory` fail closed (exit 1, "no Int declaration matches").