| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lelttric | Structured version Visualization version GIF version | ||
| Description: Trichotomy law. (Contributed by NM, 4-Apr-2005.) |
| Ref | Expression |
|---|---|
| lelttric | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.1 903 | . 2 ⊢ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴) | |
| 2 | lenlt 11219 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 3 | 2 | orbi1d 923 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴) ↔ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴))) |
| 4 | 1, 3 | mpbiri 260 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∨ wo 854 ∈ wcel 2121 class class class wbr 5075 ℝcr 11032 < clt 11174 ≤ cle 11175 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5221 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-br 5076 df-opab 5138 df-xp 5627 df-cnv 5629 df-xr 11178 df-le 11180 |
| This theorem is referenced by: ltlecasei 11249 fzsplit2 13498 uzsplit 13545 fzospliti 13641 fzouzsplit 13644 discr1 14196 faclbnd 14247 faclbnd4lem1 14250 faclbnd4lem4 14253 dvdslelem 16273 dvdsprmpweqle 16852 icccmplem2 24811 icccmp 24813 bcmono 27262 bpos1lem 27267 bposlem3 27271 bpos 27278 fzsplit3 32889 submateq 34005 lzunuz 43232 jm2.24 43423 fzuntgd 43917 iccpartnel 47927 bgoldbtbnd 48314 tgoldbach 48322 reorelicc 49215 |
| Copyright terms: Public domain | W3C validator |