| 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 9655 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | negeq 8526 | . . . . . 6 ⊢ (𝑁 = 0 → -𝑁 = -0) | |
| 3 | neg0 8579 | . . . . . 6 ⊢ -0 = 0 | |
| 4 | 2, 3 | eqtrdi 2287 | . . . . 5 ⊢ (𝑁 = 0 → -𝑁 = 0) |
| 5 | 0z 9664 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 6 | 4, 5 | eqeltrdi 2329 | . . . 4 ⊢ (𝑁 = 0 → -𝑁 ∈ ℤ) |
| 7 | nnnegz 9656 | . . . 4 ⊢ (𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 8 | nnz 9672 | . . . 4 ⊢ ( -𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 9 | 6, 7, 8 | 3jaoi 1344 | . . 3 ⊢ ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) → -𝑁 ∈ ℤ) |
| 10 | 9 | adantl 277 | . 2 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) → -𝑁 ∈ ℤ) |
| 11 | 1, 10 | sylbi 121 | 1 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∨ w3o 1008 = wceq 1402 ∈ wcel 2209 ℝcr 8184 0cc0 8185 -cneg 8505 ℕcn 9313 ℤcz 9653 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-iota 5340 df-fun 5382 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-z 9654 |
| This theorem is used by: znegclb 9686 nn0negz 9687 peano2zm 9691 zsubcl 9694 zeo 9761 zindd 9774 znegcld 9780 uzneg 9956 qnegcl 10051 fzsubel 10482 fzosubel 10628 ceilid 10772 modqcyc2 10817 expsubap 11044 climshft 12094 negdvdsb 12598 dvdsnegb 12599 summodnegmod 12613 dvdssub 12629 odd2np1 12664 bitscmp 12749 gcdneg 12783 neggcd 12784 gcdabs 12789 bezoutlemaz 12804 bezoutlembz 12805 lcmneg 12876 neglcm 12877 lcmabs 12878 4sqexercise1 13205 4sqexercise2 13206 mulgval 13983 mulgaddcomlem 14006 mulgneg2 14017 mulgsubdir 14023 zsubrg 15026 zringmulg 15041 zringinvg 15047 sinperlem 16052 lgsneg 16365 lgsdir2lem4 16372 lgsdir2lem5 16373 ex-fl 16961 |
| Copyright terms: Public domain | W3C validator |