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 11045 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) | |
2 | 1 | 3adant1 1128 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 ↔ (𝐵 < 𝐶 ∨ 𝐵 = 𝐶))) |
3 | lttr 11035 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) | |
4 | 3 | expcomd 416 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
5 | breq2 5082 | . . . . . 6 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 ↔ 𝐴 < 𝐶)) | |
6 | 5 | biimpd 228 | . . . . 5 ⊢ (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶)) |
7 | 6 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 = 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
8 | 4, 7 | jaod 855 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐵 < 𝐶 ∨ 𝐵 = 𝐶) → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
9 | 2, 8 | sylbid 239 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐶 → (𝐴 < 𝐵 → 𝐴 < 𝐶))) |
10 | 9 | impcomd 411 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 ∧ w3a 1085 = wceq 1541 ∈ wcel 2109 class class class wbr 5078 ℝcr 10854 < clt 10993 ≤ cle 10994 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-resscn 10912 ax-pre-lttri 10929 ax-pre-lttrn 10930 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4845 df-br 5079 df-opab 5141 df-mpt 5162 df-id 5488 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-er 8472 df-en 8708 df-dom 8709 df-sdom 8710 df-pnf 10995 df-mnf 10996 df-xr 10997 df-ltxr 10998 df-le 10999 |
This theorem is referenced by: ltleletr 11051 ltletri 11086 ltletrd 11118 ltleadd 11441 lediv12a 11851 nngt0 11987 nnrecgt0 11999 elnnnn0c 12261 elnnz1 12329 zltp1le 12353 uz3m2nn 12613 zbtwnre 12668 ledivge1le 12783 addlelt 12826 qbtwnre 12915 xlemul1a 13004 xrsupsslem 13023 zltaddlt1le 13219 elfzodifsumelfzo 13434 ssfzo12bi 13463 elfznelfzo 13473 ceile 13550 swrdswrd 14399 swrdccatin1 14419 repswswrd 14478 sqrlem4 14938 resqrex 14943 caubnd 15051 rlim2lt 15187 cos01gt0 15881 ruclem12 15931 oddge22np1 16039 sadcaddlem 16145 nn0seqcvgd 16256 coprm 16397 prmgaplem7 16739 prmlem1 16790 prmlem2 16802 icoopnst 24083 ovollb2lem 24633 dvcnvrelem1 25162 aaliou 25479 tanord 25675 logdivlti 25756 logdivlt 25757 ftalem2 26204 gausslemma2dlem1a 26494 pntlem3 26738 crctcshwlkn0lem3 28156 nn0prpwlem 34490 isbasisrelowllem1 35505 isbasisrelowllem2 35506 ltflcei 35744 tan2h 35748 poimirlem29 35785 poimirlem32 35788 2xp3dxp2ge1d 40142 stoweidlem26 43521 stoweid 43558 2leaddle2 44742 gbegt5 45165 gbowgt5 45166 sgoldbeven3prm 45187 nnsum4primesodd 45200 nnsum4primesoddALTV 45201 evengpoap3 45203 bgoldbnnsum3prm 45208 cznnring 45466 nn0sumltlt 45638 rege1logbrege0 45856 rege1logbzge0 45857 fllog2 45866 dignn0ldlem 45900 |
Copyright terms: Public domain | W3C validator |