Mathlib v4.30 source proposition Nat.descFactorial_le

Identifier: F:ml430-nat-descfactorial-le-2b8cc09a
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

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

Formal statement

∀ (n : ℕ) {k m : ℕ}, k ≤ m → k.descFactorial n ≤ m.descFactorial n

Dependencies

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

2 direct dependencies 0 direct dependents

Evidence

kernel-Nat.descFactorial_le

Kind: kernel-term
Status: checked

Supports: ∀ (n : ℕ) {k m : ℕ}, k ≤ m → k.descFactorial n ≤ m.descFactorial n

Checker command

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

Evidence notes

`build_nat_prelude` admits `Nat.descFactorial_le` through the trusted `Kernel::add_declaration` gate. Route: rewrite `Le (choose k n) (choose m n)` (`Nat.choose_le_choose`, directly from the hypothesis `k <= m`) up to `Le (mul (factorial n) (choose k n)) (mul (factorial n) (choose m n))` (`Nat.mul_le_mul_left`), then transport twice along `Nat.descFactorial_eq_factorial_mul_choose`'s bridge equations (at `(k, n)` and `(m, n)`, both reversed) to land on `Le (descFactorial k n) (descFactorial m n)`. `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.descFactorial_le

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 (not merely the environment-wide bound), by name, in-tree.

Provenance

{
  "date": "2026-08-18",
  "established_by": "not established in this ledger",
  "source": "statement-only extraction of `Nat.descFactorial_le` from Mathlib v4.30.0; no proof value was exposed",
  "prior_art": [
    {
      "who": "the Mathlib contributors",
      "what": "the theorem declaration `Nat.descFactorial_le`",
      "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"
    }
  ]
}