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 11111 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) | |
2 | 1 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) |
3 | lttr 11101 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) | |
4 | 3 | expcomd 418 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
5 | breq2 5085 | . . . . . 6 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 ↔ 𝐴 < 𝐶)) | |
6 | 5 | biimpd 228 | . . . . 5 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶)) |
7 | 6 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
8 | 4, 7 | jaod 857 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐵 < 𝐶 ∨ 𝐵 = 𝐶) → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
9 | 2, 8 | sylbid 239 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
10 | 9 | impcomd 413 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 845 ∧ w3a 1087 = wceq 1539 ∈ wcel 2104 class class class wbr 5081 ℝcr 10920 < clt 11059 ≤ cle 11060 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-resscn 10978 ax-pre-lttri 10995 ax-pre-lttrn 10996 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rab 3306 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11061 df-mnf 11062 df-xr 11063 df-ltxr 11064 df-le 11065 |
This theorem is referenced by: ltleletr 11118 ltletri 11153 ltletrd 11185 ltleadd 11508 lediv12a 11918 nngt0 12054 nnrecgt0 12066 elnnnn0c 12328 elnnz1 12396 zltp1le 12420 uz3m2nn 12681 zbtwnre 12736 ledivge1le 12851 addlelt 12894 qbtwnre 12983 xlemul1a 13072 xrsupsslem 13091 zltaddlt1le 13287 elfzodifsumelfzo 13503 ssfzo12bi 13532 elfznelfzo 13542 ceile 13619 swrdswrd 14467 swrdccatin1 14487 repswswrd 14546 sqrlem4 15006 resqrex 15011 caubnd 15119 rlim2lt 15255 cos01gt0 15949 ruclem12 15999 oddge22np1 16107 sadcaddlem 16213 nn0seqcvgd 16324 coprm 16465 prmgaplem7 16807 prmlem1 16858 prmlem2 16870 icoopnst 24151 ovollb2lem 24701 dvcnvrelem1 25230 aaliou 25547 tanord 25743 logdivlti 25824 logdivlt 25825 ftalem2 26272 gausslemma2dlem1a 26562 pntlem3 26806 crctcshwlkn0lem3 28226 nn0prpwlem 34560 isbasisrelowllem1 35574 isbasisrelowllem2 35575 ltflcei 35813 tan2h 35817 poimirlem29 35854 poimirlem32 35857 2xp3dxp2ge1d 40362 stoweidlem26 43796 stoweid 43833 2leaddle2 45034 gbegt5 45457 gbowgt5 45458 sgoldbeven3prm 45479 nnsum4primesodd 45492 nnsum4primesoddALTV 45493 evengpoap3 45495 bgoldbnnsum3prm 45500 cznnring 45758 nn0sumltlt 45930 rege1logbrege0 46148 rege1logbzge0 46149 fllog2 46158 dignn0ldlem 46192 |
Copyright terms: Public domain | W3C validator |