kernel-Int.add_le_add_iff_left
- Kind
- kernel-term
- Status
- checked
Supports: `Int.add_le_add_iff_left` is admitted as a Theorem with EXACTLY the stated shape, pinned verbatim via the kernel's own renderer: `((x0 : Int) -> ((x1 : Int) -> ((x2 : Int) -> Iff (Int.le (Int.add x2 x0) (Int.add x2 x1)) (Int.le x0 x1))))`. Built in a new file, int_prelude/order_add.rs, as a corollary of the already-derived Int.add_le_add plus Int.add_neg_cancel_right (algebra.rs) and modeq.rs's cancel_neg_add/cancel_neg_add_left -- no Int.rec case split anywhere in the new file.
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_iff_left" && $4 == "((x0 : Int) -> ((x1 : Int) -> ((x2 : Int) -> Iff (Int.le (Int.add x2 x0) (Int.add x2 x1)) (Int.le x0 x1))))"' | wc -l)" -ge 1