kernel-Nat.primeCounting_mono
- Kind
- kernel-term
- Status
- checked
Supports: pi(m) <= pi(n) whenever m <= n
test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- 'Nat.primeCounting_mono' 2>/dev/null | grep -xFc 'Nat.primeCounting_mono 3 ((x0 : AxNat) -> ((x1 : AxNat) -> ((x2 : AxNat.le x0 x1) -> AxNat.le (AxNat.primeCounting x0) (AxNat.primeCounting x1))))')" -ge 1 Evidence notes
`Nat.primeCounting n` is `Nat.primeCounting' (succ n)`, so this is `Nat.countRange_le_of_le` again with the hypothesis moved by `Nat.succ_le_succ`. The rendered type is what separates it from `F:nat-prime-counting-prime-mono`: the two differ only in which of the two counting conventions appears, and `primeCounting' 2 = 0` while `primeCounting 2 = 1`.