| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > znegcl | GIF version | ||
| Description: Closure law for negative integers. (Contributed by NM, 9-May-2004.) |
| Ref | Expression |
|---|---|
| znegcl | ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elz 9579 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | negeq 8466 | . . . . . 6 ⊢ (𝑁 = 0 → -𝑁 = -0) | |
| 3 | neg0 8519 | . . . . . 6 ⊢ -0 = 0 | |
| 4 | 2, 3 | eqtrdi 2281 | . . . . 5 ⊢ (𝑁 = 0 → -𝑁 = 0) |
| 5 | 0z 9588 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 6 | 4, 5 | eqeltrdi 2323 | . . . 4 ⊢ (𝑁 = 0 → -𝑁 ∈ ℤ) |
| 7 | nnnegz 9580 | . . . 4 ⊢ (𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 8 | nnz 9596 | . . . 4 ⊢ (-𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 9 | 6, 7, 8 | 3jaoi 1340 | . . 3 ⊢ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) → -𝑁 ∈ ℤ) |
| 10 | 9 | adantl 277 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) → -𝑁 ∈ ℤ) |
| 11 | 1, 10 | sylbi 121 | 1 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ w3o 1004 = wceq 1398 ∈ wcel 2203 ℝcr 8126 0cc0 8127 -cneg 8445 ℕcn 9237 ℤcz 9577 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-br 4110 df-opab 4172 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-iota 5312 df-fun 5354 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-inn 9238 df-z 9578 |
| This theorem is referenced by: znegclb 9610 nn0negz 9611 peano2zm 9615 zsubcl 9618 zeo 9683 zindd 9696 znegcld 9702 uzneg 9873 qnegcl 9968 fzsubel 10394 fzosubel 10539 ceilid 10677 modqcyc2 10722 expsubap 10949 climshft 11989 negdvdsb 12493 dvdsnegb 12494 summodnegmod 12508 dvdssub 12524 odd2np1 12559 bitscmp 12644 gcdneg 12678 neggcd 12679 gcdabs 12684 bezoutlemaz 12699 bezoutlembz 12700 lcmneg 12771 neglcm 12772 lcmabs 12773 4sqexercise1 13096 4sqexercise2 13097 mulgval 13839 mulgaddcomlem 13862 mulgneg2 13873 mulgsubdir 13879 zsubrg 14729 zringmulg 14746 zringinvg 14752 sinperlem 15673 lgsneg 15897 lgsdir2lem4 15904 lgsdir2lem5 15905 ex-fl 16493 |
| Copyright terms: Public domain | W3C validator |