| 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 11231 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) | |
| 2 | 1 | 3adant1 1131 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) |
| 3 | lttr 11221 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) | |
| 4 | 3 | expcomd 416 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 5 | breq2 5104 | . . . . . 6 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 ↔ 𝐴 < 𝐶)) | |
| 6 | 5 | biimpd 229 | . . . . 5 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶)) |
| 7 | 6 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
| 8 | 4, 7 | jaod 860 | . . 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 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 ℝcr 11037 < clt 11178 ≤ cle 11179 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-resscn 11095 ax-pre-lttri 11112 ax-pre-lttrn 11113 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 |
| This theorem is referenced by: ltleletr 11238 ltletri 11273 ltletrd 11305 ltleadd 11632 lediv12a 12047 nngt0 12188 nnrecgt0 12200 elnnnn0c 12458 elnnz1 12529 zltp1le 12553 uz3m2nn 12819 zbtwnre 12871 ledivge1le 12990 addlelt 13033 qbtwnre 13126 xlemul1a 13215 xrsupsslem 13234 zltaddlt1le 13433 elfzodifsumelfzo 13659 ssfzo12bi 13689 elfznelfzo 13701 ceile 13781 swrdswrd 14640 swrdccatin1 14660 repswswrd 14719 01sqrexlem4 15180 resqrex 15185 caubnd 15294 rlim2lt 15432 cos01gt0 16128 ruclem12 16178 oddge22np1 16288 sadcaddlem 16396 nn0seqcvgd 16509 coprm 16650 prmgaplem7 16997 prmlem1 17047 prmlem2 17059 icoopnst 24904 ovollb2lem 25457 dvcnvrelem1 25990 aaliou 26314 tanord 26515 logdivlti 26597 logdivlt 26598 ftalem2 27052 gausslemma2dlem1a 27344 pntlem3 27588 crctcshwlkn0lem3 29897 nn0prpwlem 36538 isbasisrelowllem1 37610 isbasisrelowllem2 37611 ltflcei 37859 tan2h 37863 poimirlem29 37900 poimirlem32 37903 stoweidlem26 46384 stoweid 46421 2leaddle2 47658 gbegt5 48121 gbowgt5 48122 sgoldbeven3prm 48143 nnsum4primesodd 48156 nnsum4primesoddALTV 48157 evengpoap3 48159 bgoldbnnsum3prm 48164 cznnring 48622 nn0sumltlt 48710 rege1logbrege0 48918 rege1logbzge0 48919 fllog2 48928 dignn0ldlem 48962 |
| Copyright terms: Public domain | W3C validator |