| 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 9481 | . 2 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
| 2 | negeq 8372 | . . . . . 6 ⊢ (𝑁 = 0 → -𝑁 = -0) | |
| 3 | neg0 8425 | . . . . . 6 ⊢ -0 = 0 | |
| 4 | 2, 3 | eqtrdi 2280 | . . . . 5 ⊢ (𝑁 = 0 → -𝑁 = 0) |
| 5 | 0z 9490 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 6 | 4, 5 | eqeltrdi 2322 | . . . 4 ⊢ (𝑁 = 0 → -𝑁 ∈ ℤ) |
| 7 | nnnegz 9482 | . . . 4 ⊢ (𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 8 | nnz 9498 | . . . 4 ⊢ (-𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | |
| 9 | 6, 7, 8 | 3jaoi 1339 | . . 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 1003 = wceq 1397 ∈ wcel 2202 ℝcr 8031 0cc0 8032 -cneg 8351 ℕcn 9143 ℤcz 9479 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-z 9480 |
| This theorem is referenced by: znegclb 9512 nn0negz 9513 peano2zm 9517 zsubcl 9520 zeo 9585 zindd 9598 znegcld 9604 uzneg 9775 qnegcl 9870 fzsubel 10295 fzosubel 10440 ceilid 10578 modqcyc2 10623 expsubap 10850 climshft 11882 negdvdsb 12386 dvdsnegb 12387 summodnegmod 12401 dvdssub 12417 odd2np1 12452 bitscmp 12537 gcdneg 12571 neggcd 12572 gcdabs 12577 bezoutlemaz 12592 bezoutlembz 12593 lcmneg 12664 neglcm 12665 lcmabs 12666 4sqexercise1 12989 4sqexercise2 12990 mulgval 13727 mulgaddcomlem 13750 mulgneg2 13761 mulgsubdir 13767 zsubrg 14614 zringmulg 14631 zringinvg 14637 sinperlem 15551 lgsneg 15772 lgsdir2lem4 15779 lgsdir2lem5 15780 ex-fl 16368 |
| Copyright terms: Public domain | W3C validator |