| 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 11326 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) | |
| 2 | 1 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) |
| 3 | lttr 11316 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) | |
| 4 | 3 | expcomd 416 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 5 | breq2 5128 | . . . . . 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 1540 ∈ wcel 2109 class class class wbr 5124 ℝcr 11133 < clt 11274 ≤ cle 11275 |
| 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-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-resscn 11191 ax-pre-lttri 11208 ax-pre-lttrn 11209 |
| 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-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 |
| This theorem is referenced by: ltleletr 11333 ltletri 11368 ltletrd 11400 ltleadd 11725 lediv12a 12140 nngt0 12276 nnrecgt0 12288 elnnnn0c 12551 elnnz1 12623 zltp1le 12647 uz3m2nn 12912 zbtwnre 12967 ledivge1le 13085 addlelt 13128 qbtwnre 13220 xlemul1a 13309 xrsupsslem 13328 zltaddlt1le 13527 elfzodifsumelfzo 13752 ssfzo12bi 13782 elfznelfzo 13793 ceile 13871 swrdswrd 14728 swrdccatin1 14748 repswswrd 14807 01sqrexlem4 15269 resqrex 15274 caubnd 15382 rlim2lt 15518 cos01gt0 16214 ruclem12 16264 oddge22np1 16373 sadcaddlem 16481 nn0seqcvgd 16594 coprm 16735 prmgaplem7 17082 prmlem1 17132 prmlem2 17144 icoopnst 24892 ovollb2lem 25446 dvcnvrelem1 25979 aaliou 26303 tanord 26504 logdivlti 26586 logdivlt 26587 ftalem2 27041 gausslemma2dlem1a 27333 pntlem3 27577 crctcshwlkn0lem3 29799 nn0prpwlem 36345 isbasisrelowllem1 37378 isbasisrelowllem2 37379 ltflcei 37637 tan2h 37641 poimirlem29 37678 poimirlem32 37681 stoweidlem26 46035 stoweid 46072 2leaddle2 47307 gbegt5 47755 gbowgt5 47756 sgoldbeven3prm 47777 nnsum4primesodd 47790 nnsum4primesoddALTV 47791 evengpoap3 47793 bgoldbnnsum3prm 47798 cznnring 48217 nn0sumltlt 48305 rege1logbrege0 48518 rege1logbzge0 48519 fllog2 48528 dignn0ldlem 48562 |
| Copyright terms: Public domain | W3C validator |