kernel-Nat.gcd_mul_lcm
- Kind
- kernel-term
- Status
- checked
Supports: ∀ (m n : ℕ), m.gcd n * m.lcm n = m * n
test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- gcd_mul_lcm 2>/dev/null | grep -Ec '^Nat\.gcd_mul_lcm[[:space:]]')" -ge 1 Evidence notes
`build_nat_prelude` admits `Nat.gcd_mul_lcm` through the trusted `Kernel::add_declaration` gate (declared in `nat_prelude/lcm.rs`'s `declare_gcd_mul_lcm`, landed before this session). Route: induction on the first argument; the zero case collapses via `zero_mul`/`zero_div`, the successor case is `div_mul_cancel_of_dvd` applied to `gcd a b` dividing `a * b` (via `dvd_mul_right_of_dvd` on `gcd_dvd_left`), which is definitionally `lcm a b`. `nat_theorem_inventory`'s rendered type for `Nat.gcd_mul_lcm` is `((x0 : AxNat) -> ((x1 : AxNat) -> Eq.{1} AxNat (AxNat.mul (AxNat.gcd x0 x1) (AxNat.lcm x0 x1)) (AxNat.mul x0 x1)))`, matching this fact's `formal.statement` verbatim (`x0`/`x1`/`x2` are the universally quantified variables in order). `nat_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.