| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ztri3or | GIF version | ||
| Description: Integer trichotomy. (Contributed by Jim Kingdon, 14-Mar-2020.) |
| Ref | Expression |
|---|---|
| ztri3or | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ∨ 𝑀 = 𝑁 ∨ 𝑁 < 𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zsubcl 9498 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − 𝑁) ∈ ℤ) | |
| 2 | ztri3or0 9499 | . . 3 ⊢ ((𝑀 − 𝑁) ∈ ℤ → ((𝑀 − 𝑁) < 0 ∨ (𝑀 − 𝑁) = 0 ∨ 0 < (𝑀 − 𝑁))) | |
| 3 | 1, 2 | syl 14 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 𝑁) < 0 ∨ (𝑀 − 𝑁) = 0 ∨ 0 < (𝑀 − 𝑁))) |
| 4 | zre 9461 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | 4 | adantr 276 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℝ) |
| 6 | zre 9461 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 7 | 6 | adantl 277 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ) |
| 8 | 5, 7 | posdifd 8690 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ 0 < (𝑁 − 𝑀))) |
| 9 | 7, 5 | resubcld 8538 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 − 𝑀) ∈ ℝ) |
| 10 | 9 | lt0neg2d 8674 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 < (𝑁 − 𝑀) ↔ -(𝑁 − 𝑀) < 0)) |
| 11 | 7 | recnd 8186 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℂ) |
| 12 | 5 | recnd 8186 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℂ) |
| 13 | 11, 12 | negsubdi2d 8484 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → -(𝑁 − 𝑀) = (𝑀 − 𝑁)) |
| 14 | 13 | breq1d 4093 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (-(𝑁 − 𝑀) < 0 ↔ (𝑀 − 𝑁) < 0)) |
| 15 | 8, 10, 14 | 3bitrd 214 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑀 − 𝑁) < 0)) |
| 16 | 12, 11 | subeq0ad 8478 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 𝑁) = 0 ↔ 𝑀 = 𝑁)) |
| 17 | 16 | bicomd 141 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 = 𝑁 ↔ (𝑀 − 𝑁) = 0)) |
| 18 | 7, 5 | posdifd 8690 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ 0 < (𝑀 − 𝑁))) |
| 19 | 15, 17, 18 | 3orbi123d 1345 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 < 𝑁 ∨ 𝑀 = 𝑁 ∨ 𝑁 < 𝑀) ↔ ((𝑀 − 𝑁) < 0 ∨ (𝑀 − 𝑁) = 0 ∨ 0 < (𝑀 − 𝑁)))) |
| 20 | 3, 19 | mpbird 167 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ∨ 𝑀 = 𝑁 ∨ 𝑁 < 𝑀)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ w3o 1001 = wceq 1395 ∈ wcel 2200 class class class wbr 4083 (class class class)co 6007 ℝcr 8009 0cc0 8010 < clt 8192 − cmin 8328 -cneg 8329 ℤ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-n0 9381 df-z 9458 |
| This theorem is referenced by: zletric 9501 zlelttric 9502 zltnle 9503 zleloe 9504 zapne 9532 zdceq 9533 zdcle 9534 zdclt 9535 uzm1 9765 qtri3or 10472 iseqf1olemkle 10731 iseqf1olemklt 10732 iswrdiz 11091 cvgratz 12058 divalglemeunn 12447 divalglemeuneg 12449 znege1 12715 lgsdilem 15721 |
| Copyright terms: Public domain | W3C validator |