kernel-Int.add_le_add
- Kind
- kernel-term
- Status
- checked
Supports: `Int.add_le_add` is admitted as a Theorem with EXACTLY the stated shape, pinned verbatim via the kernel's own renderer: `((x0 : Int) -> ((x1 : Int) -> ((x2 : Int) -> ((x3 : Int) -> ((x4 : Int.le x0 x1) -> ((x5 : Int.le x2 x3) -> Int.le (Int.add x0 x2) (Int.add x1 x3)))))))`. This declaration already existed before this lane (int_prelude/order.rs::declare_additive_order); this fact closes as a status flip with no new proof.
test "$(cargo run -q --release -p axeyum-lean-kernel --example int_theorem_inventory 2>/dev/null | awk -F'\t' '$1 == "theorem" && $2 == "Int.add_le_add" && $4 == "((x0 : Int) -> ((x1 : Int) -> ((x2 : Int) -> ((x3 : Int) -> ((x4 : Int.le x0 x1) -> ((x5 : Int.le x2 x3) -> Int.le (Int.add x0 x2) (Int.add x1 x3)))))))"' | wc -l)" -ge 1