[generated] kernel theorem Nat.restrict_pair_maps_into (nat prelude, axiom-free, prose not curated)

Identifier: F:nat-restrict-pair-maps-into
Proof route: kernel-lean
External status: Not recorded
Axiom footprint: Empty

Recorded description

MECHANICALLY GENERATED, UNREVIEWED PROSE -- this sentence deliberately makes NO mathematical characterisation of the theorem. What is asserted, and all that is asserted, is this: the kernel declaration `Nat.restrict_pair_maps_into` is a `Declaration::Theorem` admitted into the environment by `build_nat_prelude` through the trusted `Kernel::add_declaration` gate, which re-derives its type from its proof term; its type is recorded verbatim in `formal.statement`; and its axiom footprint, as computed by `Kernel::axiom_footprint`, is empty. The authoritative content of this fact is `formal.statement`. A human-readable characterisation of what Nat.restrict_pair_maps_into SAYS has not been supplied, because a generator cannot supply one honestly -- see `notes`.

Formal statement

theorem Nat.restrict_pair_maps_into : ((x0 : ((x0 : AxNat) -> AxNat)) -> ((x1 : AxNat) -> ((x2 : AxNat) -> ((x3 : AxNat) -> ((x4 : AxNat.injectiveOn x0 (AxNat.succ (AxNat.succ x3))) -> ((x5 : AxNat.mapsInto x0 (AxNat.succ (AxNat.succ x3))) -> ((x6 : AxNat.lt x1 x2) -> ((x7 : AxNat.lt x2 (AxNat.succ (AxNat.succ x3))) -> ((x8 : AxNat.setwise_fixed x0 x1 x2) -> AxNat.mapsInto (fun (x9 : AxNat) => Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.pred (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.pred (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1)))) (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1))) (AxNat.ble (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1))) x1))) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.pred (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1)))) (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1))) (AxNat.ble (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1))) x1)) (AxNat.ble (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.pred (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1)))) (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1))) (AxNat.ble (x0 (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (Bool.rec.{1} (fun (x10 : Bool) => AxNat) (AxNat.succ (AxNat.succ x9)) (AxNat.succ x9) (AxNat.ble (AxNat.succ (AxNat.succ x9)) x2)) x9 (AxNat.ble (AxNat.succ x9) x1))) x1)) (AxNat.pred x2))) x3)))))))))

Dependencies

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

23 direct dependencies 0 direct dependents Graph shows the first 8 on each side.

Evidence

kernel-Nat.restrict_pair_maps_into

Kind: kernel-term
Status: checked

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

Checker command

cargo run -q --release -p axeyum-lean-kernel --example theorem_dependency_inventory -- Nat.restrict_pair_maps_into 2>/dev/null | grep -cE '^Nat\.restrict_pair_maps_into[[:space:]]'

Evidence notes

Two independent failure modes, so the exit status depends on the finding rather than on the run completing: theorem_dependency_inventory exits non-zero when a NAMED filter matches nothing, and grep -c exits 1 printing 0 when the anchored line is absent. Anchored with [[:space:]], never \t -- in a scripted (GNU) grep \t is a literal t. grep -c rather than grep -q, which would SIGPIPE the producer under pipefail. --release is MANDATORY: this tool builds creal/complex/cpoint, which overflow the default debug thread stack.

footprint-Nat.restrict_pair_maps_into

Kind: exhaustive-enumeration
Status: checked

Supports: axiom_footprint: [] -- the nat prelude's trusted surface is empty, which bounds Nat.restrict_pair_maps_into.

Checker command

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

Evidence notes

--require-axiom-free exits non-zero when the named prelude's trusted surface (Axiom + Opaque + Quotient) is not empty, and errors rather than silently passing for a prelude the run never built. A declaration cannot depend on a trusted declaration the environment does not contain, so an empty nat surface bounds every declaration in it, including Nat.restrict_pair_maps_into. This is a whole-prelude bound, not a per-declaration measurement; the per-declaration figure is the footprint column of kernel_declaration_projection, measured 0 for this row.

Provenance

{
  "date": "2026-08-27",
  "curation": "generated-unreviewed",
  "generated_by": "scripts/gen-kernel-facts.py",
  "established_by": "axeyum-lean-kernel build_nat_prelude (crates/axeyum-lean-kernel/src/nat_prelude/)",
  "source": "Derived mechanically from the unfiltered emit of `cargo run -q --release -p axeyum-lean-kernel --example kernel_declaration_projection`, which prints one TSV row per declaration whose fields are (prelude, kind, display name, axiom-footprint size, direct type declarations, direct declarations, direct theorems, Kernel::render_lean(declaration.ty())). formal.statement is that last field verbatim; depends_on is the direct-theorem column intersected with this ledger's registered facts; axiom_footprint is the footprint-size column, cross-checked by the whole-prelude nat_axiom_inventory run recorded in the second evidence row. No field was hand-transcribed and no prose was authored."
}