| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pltletr | Structured version Visualization version GIF version | ||
| Description: Transitive law for chained "less than" and "less than or equal to". (psssstr 4061 analog.) (Contributed by NM, 2-Dec-2011.) |
| Ref | Expression |
|---|---|
| pltletr.b | ⊢ 𝐵 = (Base‘𝐾) |
| pltletr.l | ⊢ ≤ = (le‘𝐾) |
| pltletr.s | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| pltletr | ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pltletr.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | pltletr.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
| 3 | pltletr.s | . . . . . 6 ⊢ < = (lt‘𝐾) | |
| 4 | 1, 2, 3 | pleval2 18258 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 5 | 4 | 3adant3r1 1183 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 6 | 5 | adantr 480 | . . 3 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 7 | 1, 3 | plttr 18263 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| 8 | 7 | expdimp 452 | . . . 4 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 < 𝑍 → 𝑋 < 𝑍)) |
| 9 | breq2 5102 | . . . . . 6 ⊢ (𝑌 = 𝑍 → (𝑋 < 𝑌 ↔ 𝑋 < 𝑍)) | |
| 10 | 9 | biimpcd 249 | . . . . 5 ⊢ (𝑋 < 𝑌 → (𝑌 = 𝑍 → 𝑋 < 𝑍)) |
| 11 | 10 | adantl 481 | . . . 4 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 = 𝑍 → 𝑋 < 𝑍)) |
| 12 | 8, 11 | jaod 859 | . . 3 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → ((𝑌 < 𝑍 ∨ 𝑌 = 𝑍) → 𝑋 < 𝑍)) |
| 13 | 6, 12 | sylbid 240 | . 2 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 ≤ 𝑍 → 𝑋 < 𝑍)) |
| 14 | 13 | expimpd 453 | 1 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍)) |
| 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 ‘cfv 6492 Basecbs 17136 lecple 17184 Posetcpo 18230 ltcplt 18231 |
| 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-pr 5377 |
| 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-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 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-iota 6448 df-fun 6494 df-fv 6500 df-proset 18217 df-poset 18236 df-plt 18251 |
| This theorem is referenced by: cvrletrN 39529 atlen0 39566 atlelt 39694 2atlt 39695 ps-2 39734 llnnleat 39769 lplnnle2at 39797 lvolnle3at 39838 dalemcea 39916 2atm2atN 40041 dia2dimlem2 41321 dia2dimlem3 41322 |
| Copyright terms: Public domain | W3C validator |