| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xrlelttr | Structured version Visualization version GIF version | ||
| Description: Transitive law for ordering on extended reals. (Contributed by NM, 19-Jan-2006.) |
| Ref | Expression |
|---|---|
| xrlelttr | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrleloe 13158 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐴 = 𝐵))) | |
| 2 | 1 | 3adant3 1132 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐴 = 𝐵))) |
| 3 | xrlttr 13154 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) | |
| 4 | 3 | expd 415 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐴 < 𝐵 → (𝐵 < 𝐶 → 𝐴 < 𝐶))) |
| 5 | breq1 5122 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 < 𝐶 ↔ 𝐵 < 𝐶)) | |
| 6 | 5 | biimprd 248 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝐵 < 𝐶 → 𝐴 < 𝐶)) |
| 7 | 6 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐴 = 𝐵 → (𝐵 < 𝐶 → 𝐴 < 𝐶))) |
| 8 | 4, 7 | jaod 859 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵) → (𝐵 < 𝐶 → 𝐴 < 𝐶))) |
| 9 | 2, 8 | sylbid 240 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐴 ≤ 𝐵 → (𝐵 < 𝐶 → 𝐴 < 𝐶))) |
| 10 | 9 | impd 410 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 class class class wbr 5119 ℝ*cxr 11266 < clt 11267 ≤ cle 11268 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7727 ax-cnex 11183 ax-resscn 11184 ax-pre-lttri 11201 ax-pre-lttrn 11202 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-po 5561 df-so 5562 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6483 df-fun 6532 df-fn 6533 df-f 6534 df-f1 6535 df-fo 6536 df-f1o 6537 df-fv 6538 df-er 8717 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 |
| This theorem is referenced by: xrletr 13172 xrlelttrd 13174 xrre 13183 xrre2 13184 xrmaxlt 13195 supxrun 13330 iooss1 13395 ico0 13406 iccssioo 13430 iccssico 13433 iocssioo 13454 ioossioo 13456 snunioo 13493 leordtval2 23148 lecldbas 23155 pnfnei 23156 bldisj 24335 xbln0 24351 prdsbl 24428 blsscls2 24441 metcnpi3 24483 iocmnfcld 24705 iscau3 25228 ismbf3d 25605 itgsubst 26006 mdegaddle 26029 mdegmullem 26033 ply1divmo 26091 psercnlem2 26384 ftc1anclem6 37668 ftc1anc 37671 asindmre 37673 snunioo1 45489 io1ii 48843 |
| Copyright terms: Public domain | W3C validator |