| 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 896 | . 2 ⊢ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴) | |
| 2 | lenlt 11252 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 3 | 2 | orbi1d 916 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴) ↔ (¬ 𝐵 < 𝐴 ∨ 𝐵 < 𝐴))) |
| 4 | 1, 3 | mpbiri 258 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 ∈ wcel 2109 class class class wbr 5107 ℝcr 11067 < clt 11208 ≤ cle 11209 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-opab 5170 df-xp 5644 df-cnv 5646 df-xr 11212 df-le 11214 |
| This theorem is referenced by: ltlecasei 11282 fzsplit2 13510 uzsplit 13557 fzospliti 13652 fzouzsplit 13655 discr1 14204 faclbnd 14255 faclbnd4lem1 14258 faclbnd4lem4 14261 dvdslelem 16279 dvdsprmpweqle 16857 icccmplem2 24712 icccmp 24714 bcmono 27188 bpos1lem 27193 bposlem3 27197 bpos 27204 fzsplit3 32716 submateq 33799 lzunuz 42756 jm2.24 42952 fzuntgd 43447 iccpartnel 47436 bgoldbtbnd 47807 tgoldbach 47815 reorelicc 48696 |
| Copyright terms: Public domain | W3C validator |