Multiplication by a fixed left factor preserves <=

Identifier: F:nat-mul-le-mul-left
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

For naturals a, b, c: if b <= c then a*b <= a*c.

Formal statement

theorem Nat.mul_le_mul_left : ((x0 : AxNat) -> ((x1 : AxNat) -> ((x2 : AxNat) -> ((x3 : AxNat.le x1 x2) -> AxNat.le (AxNat.mul x0 x1) (AxNat.mul x0 x2)))))

Dependencies

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

2 direct dependencies 39 direct dependents Graph shows the first 8 on each side.

Evidence

kernel-mul_le_mul_left

Kind: kernel-term
Status: checked

Supports: Nat.mul_le_mul_left is admitted by the trusted kernel gate with the type recorded in formal.statement.

Checker command

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

Evidence notes

`build_nat_prelude` admits this theorem only through the trusted kernel gate, so a successful build IS the type-check; the command both performs it and prints the admitted type, which is copied verbatim into formal.statement.

footprint-mul_le_mul_left

Kind: instance-pin
Status: checked

Supports: axiom_footprint: [] -- the Nat environment admits no trusted declaration

Checker command

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

Evidence notes

Reports `nat: axiom=0 opaque=0 quotient=0 total_trusted=0`, over the FULL trusted surface rather than Declaration::Axiom alone. The enumeration is per-environment, not per-theorem; it bounds this theorem's footprint because a proof cannot depend on a trusted declaration the environment does not contain.

Provenance

{
  "date": "2026-08-25",
  "established_by": "axeyum-lean-kernel build_nat_prelude",
  "source": "theorem name and canonical type read directly via nat_theorem_inventory, which prints render_lean of the admitted type."
}