| 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 18429 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 5 | 4 | 3adant3r1 1201 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 6 | 5 | adantr 486 | . . 3 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 7 | 1, 3 | plttr 18434 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| 8 | 7 | expdimp 458 | . . . 4 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 < 𝑍 → 𝑋 < 𝑍)) |
| 9 | breq2 5111 | . . . . . 6 ⊢ (𝑌 = 𝑍 → (𝑋 < 𝑌 ↔ 𝑋 < 𝑍)) | |
| 10 | 9 | biimpcd 252 | . . . . 5 ⊢ (𝑋 < 𝑌 → (𝑌 = 𝑍 → 𝑋 < 𝑍)) |
| 11 | 10 | adantl 487 | . . . 4 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 = 𝑍 → 𝑋 < 𝑍)) |
| 12 | 8, 11 | jaod 873 | . . 3 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → ((𝑌 < 𝑍 ∨ 𝑌 = 𝑍) → 𝑋 < 𝑍)) |
| 13 | 6, 12 | sylbid 243 | . 2 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 ≤ 𝑍 → 𝑋 < 𝑍)) |
| 14 | 13 | expimpd 459 | 1 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5107 ‘cfv 6537 Basecbs 17307 lecple 17355 Posetcpo 18401 ltcplt 18402 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-proset 18388 df-poset 18407 df-plt 18422 |
| This theorem is used by: cvrletrN 40154 atlen0 40191 atlelt 40319 2atlt 40320 ps-2 40359 llnnleat 40394 lplnnle2at 40422 lvolnle3at 40463 dalemcea 40541 2atm2atN 40666 dia2dimlem2 41946 dia2dimlem3 41947 |
| Copyright terms: Public domain | W3C validator |