kernel-Nat.add_mod_left
- Kind
- kernel-term
- Status
- checked
Supports: ∀ (x z : ℕ), (x + z) % x = z % x
test "$(cargo run -q -p axeyum-lean-kernel --example nat_theorem_inventory -- add_mod_left 2>/dev/null | grep -Ec '^Nat\.add_mod_left[[:space:]]')" -ge 1 Evidence notes
`build_nat_prelude` admits `Nat.add_mod_left` through the trusted `Kernel::add_declaration` gate (declared in `nat_prelude/div_mod_lemmas.rs`'s `declare_add_div_mod_shift_family`). Route: no positivity hypothesis is given, so the divisor `x` is case-split via `cases_zero_succ`; at `x=0` the goal collapses via `zero_add`, at `x=succ xpred` it reads `x+z` as `z+x*1` (`add_comm` then `mul_one` backwards) to reach `div_mod_shift`'s reusable `(n+dd*k)%dd = n%dd` fact at `dd:=x`, `n:=z`, `k:=1`. `nat_theorem_inventory`'s rendered type for `Nat.add_mod_left` is `(x0:AxNat)->(x1:AxNat)->Eq (mod (add x0 x1) x0) (mod x1 x0)`, matching this fact's `formal.statement` verbatim (`x0`=x, `x1`=z). `nat_theorem_inventory` exits non-zero for a name that does not exist, and the `grep -c` count (tested `-ge 1`, not piped into `grep -q`) requires the admitted declaration to actually be printed.