| 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 4066 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 18381 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 5 | 4 | 3adant3r1 1199 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 6 | 5 | adantr 485 | . . 3 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 ≤ 𝑍 ↔ (𝑌 < 𝑍 ∨ 𝑌 = 𝑍))) |
| 7 | 1, 3 | plttr 18386 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| 8 | 7 | expdimp 457 | . . . 4 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 < 𝑍 → 𝑋 < 𝑍)) |
| 9 | breq2 5109 | . . . . . 6 ⊢ (𝑌 = 𝑍 → (𝑋 < 𝑌 ↔ 𝑋 < 𝑍)) | |
| 10 | 9 | biimpcd 252 | . . . . 5 ⊢ (𝑋 < 𝑌 → (𝑌 = 𝑍 → 𝑋 < 𝑍)) |
| 11 | 10 | adantl 486 | . . . 4 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 = 𝑍 → 𝑋 < 𝑍)) |
| 12 | 8, 11 | jaod 872 | . . 3 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → ((𝑌 < 𝑍 ∨ 𝑌 = 𝑍) → 𝑋 < 𝑍)) |
| 13 | 6, 12 | sylbid 243 | . 2 ⊢ (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋 < 𝑌) → (𝑌 ≤ 𝑍 → 𝑋 < 𝑍)) |
| 14 | 13 | expimpd 458 | 1 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 class class class wbr 5105 ‘cfv 6525 Basecbs 17259 lecple 17307 Posetcpo 18353 ltcplt 18354 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-iota 6481 df-fun 6527 df-fv 6533 df-proset 18340 df-poset 18359 df-plt 18374 |
| This theorem is referenced by: cvrletrN 39909 atlen0 39946 atlelt 40074 2atlt 40075 ps-2 40114 llnnleat 40149 lplnnle2at 40177 lvolnle3at 40218 dalemcea 40296 2atm2atN 40421 dia2dimlem2 41701 dia2dimlem3 41702 |
| Copyright terms: Public domain | W3C validator |