Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ztri3or0 | GIF version |
Description: Integer trichotomy (with zero). (Contributed by Jim Kingdon, 14-Mar-2020.) |
Ref | Expression |
---|---|
ztri3or0 | ⊢ (𝑁 ∈ ℤ → (𝑁 < 0 ∨ 𝑁 = 0 ∨ 0 < 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elz 9049 | . . . 4 ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | |
2 | 1 | simprbi 273 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ)) |
3 | idd 21 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 = 0 → 𝑁 = 0)) | |
4 | nngt0 8738 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 0 < 𝑁) | |
5 | 4 | a1i 9 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 ∈ ℕ → 0 < 𝑁)) |
6 | nngt0 8738 | . . . . 5 ⊢ (-𝑁 ∈ ℕ → 0 < -𝑁) | |
7 | zre 9051 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
8 | 7 | lt0neg1d 8270 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (𝑁 < 0 ↔ 0 < -𝑁)) |
9 | 6, 8 | syl5ibr 155 | . . . 4 ⊢ (𝑁 ∈ ℤ → (-𝑁 ∈ ℕ → 𝑁 < 0)) |
10 | 3, 5, 9 | 3orim123d 1298 | . . 3 ⊢ (𝑁 ∈ ℤ → ((𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ) → (𝑁 = 0 ∨ 0 < 𝑁 ∨ 𝑁 < 0))) |
11 | 2, 10 | mpd 13 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 = 0 ∨ 0 < 𝑁 ∨ 𝑁 < 0)) |
12 | 3orrot 968 | . 2 ⊢ ((𝑁 < 0 ∨ 𝑁 = 0 ∨ 0 < 𝑁) ↔ (𝑁 = 0 ∨ 0 < 𝑁 ∨ 𝑁 < 0)) | |
13 | 11, 12 | sylibr 133 | 1 ⊢ (𝑁 ∈ ℤ → (𝑁 < 0 ∨ 𝑁 = 0 ∨ 0 < 𝑁)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∨ w3o 961 = wceq 1331 ∈ wcel 1480 class class class wbr 3924 ℝcr 7612 0cc0 7613 < clt 7793 -cneg 7927 ℕcn 8713 ℤcz 9047 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 ax-cnex 7704 ax-resscn 7705 ax-1cn 7706 ax-1re 7707 ax-icn 7708 ax-addcl 7709 ax-addrcl 7710 ax-mulcl 7711 ax-addcom 7713 ax-addass 7715 ax-distr 7717 ax-i2m1 7718 ax-0lt1 7719 ax-0id 7721 ax-rnegex 7722 ax-cnre 7724 ax-pre-ltirr 7725 ax-pre-ltwlin 7726 ax-pre-lttrn 7727 ax-pre-ltadd 7729 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-nel 2402 df-ral 2419 df-rex 2420 df-reu 2421 df-rab 2423 df-v 2683 df-sbc 2905 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-br 3925 df-opab 3985 df-id 4210 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-iota 5083 df-fun 5120 df-fv 5126 df-riota 5723 df-ov 5770 df-oprab 5771 df-mpo 5772 df-pnf 7795 df-mnf 7796 df-xr 7797 df-ltxr 7798 df-le 7799 df-sub 7928 df-neg 7929 df-inn 8714 df-z 9048 |
This theorem is referenced by: ztri3or 9090 zdvdsdc 11503 divalglemex 11608 divalg 11610 bezoutlemmain 11675 |
Copyright terms: Public domain | W3C validator |