| 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 11219 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) | |
| 2 | 1 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) |
| 3 | lttr 11209 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) | |
| 4 | 3 | expcomd 416 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 5 | breq2 5102 | . . . . . 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 5098 ℝcr 11025 < clt 11166 ≤ cle 11167 |
| 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 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-resscn 11083 ax-pre-lttri 11100 ax-pre-lttrn 11101 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 |
| This theorem is referenced by: ltleletr 11226 ltletri 11261 ltletrd 11293 ltleadd 11620 lediv12a 12035 nngt0 12176 nnrecgt0 12188 elnnnn0c 12446 elnnz1 12517 zltp1le 12541 uz3m2nn 12807 zbtwnre 12859 ledivge1le 12978 addlelt 13021 qbtwnre 13114 xlemul1a 13203 xrsupsslem 13222 zltaddlt1le 13421 elfzodifsumelfzo 13647 ssfzo12bi 13677 elfznelfzo 13689 ceile 13769 swrdswrd 14628 swrdccatin1 14648 repswswrd 14707 01sqrexlem4 15168 resqrex 15173 caubnd 15282 rlim2lt 15420 cos01gt0 16116 ruclem12 16166 oddge22np1 16276 sadcaddlem 16384 nn0seqcvgd 16497 coprm 16638 prmgaplem7 16985 prmlem1 17035 prmlem2 17047 icoopnst 24892 ovollb2lem 25445 dvcnvrelem1 25978 aaliou 26302 tanord 26503 logdivlti 26585 logdivlt 26586 ftalem2 27040 gausslemma2dlem1a 27332 pntlem3 27576 crctcshwlkn0lem3 29885 nn0prpwlem 36516 isbasisrelowllem1 37560 isbasisrelowllem2 37561 ltflcei 37809 tan2h 37813 poimirlem29 37850 poimirlem32 37853 stoweidlem26 46270 stoweid 46307 2leaddle2 47544 gbegt5 48007 gbowgt5 48008 sgoldbeven3prm 48029 nnsum4primesodd 48042 nnsum4primesoddALTV 48043 evengpoap3 48045 bgoldbnnsum3prm 48050 cznnring 48508 nn0sumltlt 48596 rege1logbrege0 48804 rege1logbzge0 48805 fllog2 48814 dignn0ldlem 48848 |
| Copyright terms: Public domain | W3C validator |