| 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 910 | . 2 ⊢ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴) | |
| 2 | lenlt 11337 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 3 | 2 | orbi1d 930 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴) ↔ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴))) |
| 4 | 1, 3 | mpbiri 261 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 ∈ wcel 2145 class class class wbr 5103 ℝcr 11148 < clt 11292 ≤ cle 11293 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5661 df-cnv 5663 df-xr 11296 df-le 11298 |
| This theorem is used by: ltlecasei 11367 fzsplit2 13629 uzsplit 13676 fzospliti 13772 fzouzsplit 13775 discr1 14328 faclbnd 14379 faclbnd4lem1 14382 faclbnd4lem4 14385 dvdslelem 16424 dvdsprmpweqle 17003 icccmplem2 25082 icccmp 25084 bcmono 27545 bpos1lem 27550 bposlem3 27554 bpos 27561 fzsplit3 33296 submateq 34352 lzunuz 43678 jm2.24 43869 fzuntgd 44363 iccpartnel 48403 bgoldbtbnd 48790 tgoldbach 48798 reorelicc 49705 |
| Copyright terms: Public domain | W3C validator |