| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltletr | Structured version Visualization version GIF version | ||
| Description: Transitive law. (Contributed by NM, 25-Aug-1999.) |
| Ref | Expression |
|---|---|
| ltletr | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | leloe 11210 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) | |
| 2 | 1 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) |
| 3 | lttr 11200 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) | |
| 4 | 3 | expcomd 416 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 5 | breq2 5099 | . . . . . 6 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 ↔ 𝐴 < 𝐶)) | |
| 6 | 5 | biimpd 229 | . . . . 5 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶)) |
| 7 | 6 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 8 | 4, 7 | jaod 859 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐵 < 𝐶 ∨ 𝐵 = 𝐶) → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 9 | 2, 8 | sylbid 240 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 10 | 9 | impcomd 411 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 class class class wbr 5095 ℝcr 11016 < clt 11157 ≤ cle 11158 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-resscn 11074 ax-pre-lttri 11091 ax-pre-lttrn 11092 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-er 8631 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 |
| This theorem is referenced by: ltleletr 11217 ltletri 11252 ltletrd 11284 ltleadd 11611 lediv12a 12026 nngt0 12167 nnrecgt0 12179 elnnnn0c 12437 elnnz1 12508 zltp1le 12532 uz3m2nn 12798 zbtwnre 12850 ledivge1le 12969 addlelt 13012 qbtwnre 13105 xlemul1a 13194 xrsupsslem 13213 zltaddlt1le 13412 elfzodifsumelfzo 13638 ssfzo12bi 13668 elfznelfzo 13680 ceile 13760 swrdswrd 14619 swrdccatin1 14639 repswswrd 14698 01sqrexlem4 15159 resqrex 15164 caubnd 15273 rlim2lt 15411 cos01gt0 16107 ruclem12 16157 oddge22np1 16267 sadcaddlem 16375 nn0seqcvgd 16488 coprm 16629 prmgaplem7 16976 prmlem1 17026 prmlem2 17038 icoopnst 24883 ovollb2lem 25436 dvcnvrelem1 25969 aaliou 26293 tanord 26494 logdivlti 26576 logdivlt 26577 ftalem2 27031 gausslemma2dlem1a 27323 pntlem3 27567 crctcshwlkn0lem3 29811 nn0prpwlem 36438 isbasisrelowllem1 37472 isbasisrelowllem2 37473 ltflcei 37721 tan2h 37725 poimirlem29 37762 poimirlem32 37765 stoweidlem26 46186 stoweid 46223 2leaddle2 47460 gbegt5 47923 gbowgt5 47924 sgoldbeven3prm 47945 nnsum4primesodd 47958 nnsum4primesoddALTV 47959 evengpoap3 47961 bgoldbnnsum3prm 47966 cznnring 48424 nn0sumltlt 48512 rege1logbrege0 48720 rege1logbzge0 48721 fllog2 48730 dignn0ldlem 48764 |
| Copyright terms: Public domain | W3C validator |