| 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 9525 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | negeq 8414 | . . . . . 6 ⊢ (𝑁 = 0 → -𝑁 = -0) | |
| 3 | neg0 8467 | . . . . . 6 ⊢ -0 = 0 | |
| 4 | 2, 3 | eqtrdi 2280 | . . . . 5 ⊢ (𝑁 = 0 → -𝑁 = 0) |
| 5 | 0z 9534 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 6 | 4, 5 | eqeltrdi 2322 | . . . 4 ⊢ (𝑁 = 0 → -𝑁 ∈ ℤ) |
| 7 | nnnegz 9526 | . . . 4 ⊢ (𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 8 | nnz 9542 | . . . 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 2202 ℝcr 8074 0cc0 8075 -cneg 8393 ℕcn 9185 ℤcz 9523 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| 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 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-inn 9186 df-z 9524 |
| This theorem is referenced by: znegclb 9556 nn0negz 9557 peano2zm 9561 zsubcl 9564 zeo 9629 zindd 9642 znegcld 9648 uzneg 9819 qnegcl 9914 fzsubel 10340 fzosubel 10485 ceilid 10623 modqcyc2 10668 expsubap 10895 climshft 11927 negdvdsb 12431 dvdsnegb 12432 summodnegmod 12446 dvdssub 12462 odd2np1 12497 bitscmp 12582 gcdneg 12616 neggcd 12617 gcdabs 12622 bezoutlemaz 12637 bezoutlembz 12638 lcmneg 12709 neglcm 12710 lcmabs 12711 4sqexercise1 13034 4sqexercise2 13035 mulgval 13772 mulgaddcomlem 13795 mulgneg2 13806 mulgsubdir 13812 zsubrg 14660 zringmulg 14677 zringinvg 14683 sinperlem 15602 lgsneg 15826 lgsdir2lem4 15833 lgsdir2lem5 15834 ex-fl 16422 |
| Copyright terms: Public domain | W3C validator |