| 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 9459 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | negeq 8350 | . . . . . 6 ⊢ (𝑁 = 0 → -𝑁 = -0) | |
| 3 | neg0 8403 | . . . . . 6 ⊢ -0 = 0 | |
| 4 | 2, 3 | eqtrdi 2278 | . . . . 5 ⊢ (𝑁 = 0 → -𝑁 = 0) |
| 5 | 0z 9468 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 6 | 4, 5 | eqeltrdi 2320 | . . . 4 ⊢ (𝑁 = 0 → -𝑁 ∈ ℤ) |
| 7 | nnnegz 9460 | . . . 4 ⊢ (𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 8 | nnz 9476 | . . . 4 ⊢ (-𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 9 | 6, 7, 8 | 3jaoi 1337 | . . 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 1001 = wceq 1395 ∈ wcel 2200 ℝcr 8009 0cc0 8010 -cneg 8329 ℕcn 9121 ℤcz 9457 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-ltadd 8126 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-iota 5278 df-fun 5320 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-inn 9122 df-z 9458 |
| This theorem is referenced by: znegclb 9490 nn0negz 9491 peano2zm 9495 zsubcl 9498 zeo 9563 zindd 9576 znegcld 9582 uzneg 9753 qnegcl 9843 fzsubel 10268 fzosubel 10412 ceilid 10549 modqcyc2 10594 expsubap 10821 climshft 11830 negdvdsb 12333 dvdsnegb 12334 summodnegmod 12348 dvdssub 12364 odd2np1 12399 bitscmp 12484 gcdneg 12518 neggcd 12519 gcdabs 12524 bezoutlemaz 12539 bezoutlembz 12540 lcmneg 12611 neglcm 12612 lcmabs 12613 4sqexercise1 12936 4sqexercise2 12937 mulgval 13674 mulgaddcomlem 13697 mulgneg2 13708 mulgsubdir 13714 zsubrg 14560 zringmulg 14577 zringinvg 14583 sinperlem 15497 lgsneg 15718 lgsdir2lem4 15725 lgsdir2lem5 15726 ex-fl 16144 |
| Copyright terms: Public domain | W3C validator |