A two-sided bound survives rational addition

Identifier: F:rat-bounds-add
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

If -p <= u <= p and -q <= v <= q, then -(p+q) <= u+v <= p+q -- the triangle inequality in the -b <= a <= b encoding this construction uses in place of Rat.abs.

Formal statement

theorem Rat.bounds_add : ((x0 : Rat) -> ((x1 : Rat) -> ((x2 : Rat) -> ((x3 : Rat) -> ((x4 : Rat.le (Rat.neg x1) x0) -> ((x5 : Rat.le x0 x1) -> ((x6 : Rat.le (Rat.neg x3) x2) -> ((x7 : Rat.le x2 x3) -> And (Rat.le (Rat.neg (Rat.add x1 x3)) (Rat.add x0 x2)) (Rat.le (Rat.add x0 x2) (Rat.add x1 x3))))))))))

Dependencies

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

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

Evidence

kernel-Rat.bounds_add

Kind: kernel-term
Status: checked

Supports: Rat.bounds_add 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 -- Rat.bounds_add 2>/dev/null | grep -cE '^Rat\\.bounds_add[[:space:]]'

Evidence notes

`build_rat_prelude` admits Rat.bounds_add through the trusted `Kernel::add_declaration` gate, which re-checks the proof term against the stated type, so a line in this tool's output for the exact name is a machine-checked proof having been admitted. `theorem_dependency_inventory` exits non-zero for a named filter that matches nothing (a deleted theorem cannot read as a re-derived one), and `grep -c` (never `-q`) both avoids a SIGPIPE-under-pipefail false negative and independently asserts the exact tab-anchored line is present -- two ways the same absence would be caught. `--release` is MANDATORY: this tool also builds `creal`/`complex`/`cpoint`, which recurse deep enough in a debug build to overflow the default thread stack (measured: release exits 0, debug SIGABRTs at 134) -- the same resource-limit gotcha already documented for `prelude_theorem_inventory --include-constructed`.

footprint-Rat.bounds_add

Kind: exhaustive-enumeration
Status: checked

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

Checker command

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

Evidence notes

`nat_axiom_inventory` builds the Rat environment as its own group and reports `rat: axiom=0 opaque=0 quotient=0 total_trusted=0` (re-measured on this tree). That bounds every individual Rat theorem's footprint by [], since a theorem cannot depend on a trusted declaration the environment does not contain -- and the enumeration covers Axiom, Opaque AND Quotient, not just Declaration::Axiom, because Opaque has no proof body and Quotient admits Quot.sound. `--require-axiom-free <name>` is an error (not a silent pass/zero) for a prelude this run never built, which is what makes `rat` here a claim rather than an absence.

Provenance

{
  "date": "2026-08-25",
  "established_by": "axeyum-lean-kernel build_rat_prelude",
  "source": "theorem name and dependency edges from theorem_dependency_inventory; canonical type read via a standalone probe binary depending on axeyum-lean-kernel by path and calling only its public Kernel API (environment(), display_name(), render_lean(), axiom_footprint()) -- the same calls nat_theorem_inventory itself makes -- because no in-tree example currently prints Rat theorem types (crates/ source was left untouched per this task's constraint). Probe deleted after use."
}