kernel-Nat.abundant_iff_not_perfect_and_not_deficient
- Kind
- kernel-term
- Status
- checked
Supports: 0 != n -> (Abundant n <-> Not (Perfect n) /\ Not (Deficient n))
test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- abundant_iff_not_perfect_and_not_deficient 2>/dev/null | grep -Ec '^Nat\.abundant_iff_not_perfect_and_not_deficient[[:space:]]')" -ge 1 Evidence notes
With `x := mul 2 n`, `y := sumDivisors n`: `Lt x y <-> Not (Eq y x) /\ Not (Lt y x)`, pure trichotomy of Nat's order applied to the pair `(x, y)`. Forward: two contradiction lemmas (`Lt a b` + `Eq b a`, `Lt a b` + `Lt b a`) each collapse to `lt_irrefl`. Backward: `lt_or_ge` splits `Lt x y \/ Le y x`; the `Le y x` branch splits again via `lt_or_eq_of_le` into `Lt y x \/ Eq y x`, each contradicting one conjunct. The `0 != n` hypothesis is carried (matching Mathlib's guard) but unused: this holds unconditionally for this kernel's subtraction-free forms, including at `n = 0` (both sides are `Lt 0 0`).