| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > znn0sub | Structured version Visualization version GIF version | ||
| Description: The nonnegative difference of integers is a nonnegative integer. (Generalization of nn0sub 12695.) (Contributed by NM, 14-Jul-2005.) |
| Ref | Expression |
|---|---|
| znn0sub | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ (𝑁 − 𝑀) ∈ ℕ0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zre 12736 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 2 | zre 12736 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 3 | subge0 11868 | . . . . 5 ⊢ ((𝑁 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (0 ≤ (𝑁 − 𝑀) ↔ 𝑀 ≤ 𝑁)) | |
| 4 | 1, 2, 3 | syl2an 608 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (0 ≤ (𝑁 − 𝑀) ↔ 𝑀 ≤ 𝑁)) |
| 5 | zsubcl 12777 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 − 𝑀) ∈ ℤ) | |
| 6 | 5 | biantrurd 542 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (0 ≤ (𝑁 − 𝑀) ↔ ((𝑁 − 𝑀) ∈ ℤ ∧ 0 ≤ (𝑁 − 𝑀)))) |
| 7 | 4, 6 | bitr3d 284 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ ((𝑁 − 𝑀) ∈ ℤ ∧ 0 ≤ (𝑁 − 𝑀)))) |
| 8 | 7 | ancoms 464 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ ((𝑁 − 𝑀) ∈ ℤ ∧ 0 ≤ (𝑁 − 𝑀)))) |
| 9 | elnn0z 12745 | . 2 ⊢ ((𝑁 − 𝑀) ∈ ℕ0 ↔ ((𝑁 − 𝑀) ∈ ℤ ∧ 0 ≤ (𝑁 − 𝑀))) | |
| 10 | 8, 9 | bitr4di 292 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ (𝑁 − 𝑀) ∈ ℕ0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2150 class class class wbr 5107 (class class class)co 7450 ℝcr 11237 0cc0 11238 ≤ cle 11382 − cmin 11579 ℕ0cn0 12645 ℤcz 12732 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-n0 12646 df-z 12733 |
| This theorem is used by: peano5uzi 12827 uznn0sub 13039 elfzmlbp 13812 quoremz 14034 sylow1lem1 19865 dyaddisjlem 25973 breprexplemc 35373 lcmineqlem9 43355 lerabdioph 44077 |
| Copyright terms: Public domain | W3C validator |