| 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 897 | . 2 ⊢ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴) | |
| 2 | lenlt 11224 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 3 | 2 | orbi1d 917 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴) ↔ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴))) |
| 4 | 1, 3 | mpbiri 258 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 848 ∈ wcel 2114 class class class wbr 5085 ℝcr 11037 < clt 11179 ≤ cle 11180 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-br 5086 df-opab 5148 df-xp 5637 df-cnv 5639 df-xr 11183 df-le 11185 |
| This theorem is referenced by: ltlecasei 11254 fzsplit2 13503 uzsplit 13550 fzospliti 13646 fzouzsplit 13649 discr1 14201 faclbnd 14252 faclbnd4lem1 14255 faclbnd4lem4 14258 dvdslelem 16278 dvdsprmpweqle 16857 icccmplem2 24789 icccmp 24791 bcmono 27240 bpos1lem 27245 bposlem3 27249 bpos 27256 fzsplit3 32866 submateq 33953 lzunuz 43200 jm2.24 43391 fzuntgd 43885 iccpartnel 47898 bgoldbtbnd 48285 tgoldbach 48293 reorelicc 49186 |
| Copyright terms: Public domain | W3C validator |