Mathlib v4.30 source proposition Nat.gcd_le_mul

Identifier: F:ml430-nat-gcd-le-mul-7e3800f7
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

The proposition declared as `Nat.gcd_le_mul` in the pinned Mathlib v4.30 source.

Formal statement

∀ {m n : ℕ}, 0 < m → 0 < n → m.gcd n ≤ m * n

Dependencies

The graph shows direct ledger edges. Follow a node to open its artifact page.

4 direct dependencies 0 direct dependents

Evidence

kernel-Nat.gcd_le_mul

Kind: kernel-term
Status: checked

Supports: ∀ {m n : ℕ}, 0 < m → 0 < n → m.gcd n ≤ m * n

Checker command

test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- gcd_le_mul 2>/dev/null | grep -Ec '^Nat\.gcd_le_mul[[:space:]]')" -ge 1

Evidence notes

`build_nat_prelude` admits `Nat.gcd_le_mul` through the trusted `Kernel::add_declaration` gate (declared in the new `nat_prelude/lcm_gcd_lemmas.rs`'s `declare_gcd_le_mul`). Route: `gcd_dvd_mul` gives `dvd (gcd m n) (mul m n)`; `one_le_mul` on the two positivity hypotheses gives `1 <= mul m n`; `le_of_dvd` combines them into the bound. `nat_theorem_inventory`'s rendered type for `Nat.gcd_le_mul` is `((x0 : AxNat) -> ((x1 : AxNat) -> ((x2 : AxNat.lt AxNat.zero x0) -> ((x3 : AxNat.lt AxNat.zero x1) -> AxNat.le (AxNat.gcd 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.

footprint-Nat.gcd_le_mul

Kind: exhaustive-enumeration
Status: checked

Supports: axiom_footprint: [] -- the Nat prelude's trusted surface is empty

Checker command

cargo run -q -p axeyum-lean-kernel --example nat_axiom_inventory -- --require-axiom-free nat

Evidence notes

`nat_axiom_inventory --require-axiom-free nat` enumerates the built Nat environment and exits non-zero unless it admits no Axiom, Opaque or Quotient declaration (measured: axiom=0 opaque=0 quotient=0). A theorem cannot depend on a trusted declaration the environment does not contain, so an empty trusted surface bounds every individual theorem's footprint by []. `nat_prelude_tests::every_nat_declaration_is_checked_and_axiom_free` additionally checks this theorem's own `Kernel::axiom_footprint` directly (via `theorem_names`, which now lists it), and `lcm_gcd_lemmas_apply_at_concrete_discriminating_instances` re-checks it at a concrete instantiation chosen to discriminate a swapped argument or a wrong disjunct/conclusion order via `def_eq` plus a genuinely false negative control rejected by `declare_theorem`.

Provenance

{
  "date": "2026-08-29",
  "established_by": "not established in this ledger",
  "source": "statement-only extraction of `Nat.gcd_le_mul` from Mathlib v4.30.0; no proof value was exposed",
  "prior_art": [
    {
      "who": "the Mathlib contributors",
      "what": "the theorem declaration `Nat.gcd_le_mul`",
      "where": "mathlib4 commit c5ea00351c28e24afc9f0f84379aa41082b1188f (v4.30.0)",
      "year": 2026,
      "attribution": "the proposition was read from the pinned statement-only inventory; the proof term and tactic trace were not consulted"
    }
  ]
}