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 432 | . 2 ⊢ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴) | |
2 | lenlt 9995 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
3 | 2 | orbi1d 735 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴) ↔ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴))) |
4 | 1, 3 | mpbiri 247 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∨ wo 382 ∧ wa 383 ∈ wcel 1977 class class class wbr 4583 ℝcr 9814 < clt 9953 ≤ cle 9954 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-opab 4644 df-xp 5044 df-cnv 5046 df-xr 9957 df-le 9959 |
This theorem is referenced by: ltlecasei 10024 fzsplit2 12237 uzsplit 12281 fzospliti 12369 fzouzsplit 12372 discr1 12862 faclbnd 12939 faclbnd4lem1 12942 faclbnd4lem4 12945 dvdslelem 14869 dvdsprmpweqle 15428 icccmplem2 22434 icccmp 22436 bcmono 24802 bpos1lem 24807 bposlem3 24811 bpos 24818 fzsplit3 28940 submateq 29203 lzunuz 36349 jm2.24 36548 iccpartnel 39976 bgoldbtbnd 40225 tgoldbach 40232 tgoldbachOLD 40239 |
Copyright terms: Public domain | W3C validator |