kernel-Nat.prime_deficient
- Kind
- kernel-term
- Status
- checked
Supports: Prime n -> Deficient n
test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- prime_deficient 2>/dev/null | grep -Ec '^Nat\.prime_deficient[[:space:]]')" -ge 1 Evidence notes
`prime_one_lt` gives `Lt one n`; `add_lt_add_left` lifts it to `Lt (add n one) (add n n)`, defeq `Lt (succ n) (add n n)`. A local bridge lemma (`two_mul_eq_add_self`, needed because `Nat.mul` recurses on its RIGHT argument so `mul 2 n` is stuck for symbolic `n`) relates `add n n` to `mul 2 n`, and `sum_divisors_prime` (`perfect.rs`: `sumDivisors p = succ p`) relates `succ n` to `sumDivisors n`, both via `transport` along a `symm`'d equation.