| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plelttr | Structured version Visualization version GIF version | ||
| Description: Transitive law for chained "less than or equal to" and "less than". (sspsstr 4057 analog.) (Contributed by NM, 2-May-2012.) |
| Ref | Expression |
|---|---|
| pltletr.b | ⊢ 𝐵 = (Base‘𝐾) |
| pltletr.l | ⊢ ≤ = (le‘𝐾) |
| pltletr.s | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| plelttr | ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 ≤ 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pltletr.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | pltletr.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 3 | pltletr.s | . . . . 5 ⊢ < = (lt‘𝐾) | |
| 4 | 1, 2, 3 | pleval2 18423 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 < 𝑌 ∨ 𝑋 = 𝑌))) |
| 5 | 4 | 3adant3r3 1203 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑌 ↔ (𝑋 < 𝑌 ∨ 𝑋 = 𝑌))) |
| 6 | 1, 3 | plttr 18428 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| 7 | 6 | expd 421 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 < 𝑌 → (𝑌 < 𝑍 → 𝑋 < 𝑍))) |
| 8 | breq1 5106 | . . . . . 6 ⊢ (𝑋 = 𝑌 → (𝑋 < 𝑍 ↔ 𝑌 < 𝑍)) | |
| 9 | 8 | biimprd 251 | . . . . 5 ⊢ (𝑋 = 𝑌 → (𝑌 < 𝑍 → 𝑋 < 𝑍)) |
| 10 | 9 | a1i 11 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 = 𝑌 → (𝑌 < 𝑍 → 𝑋 < 𝑍))) |
| 11 | 7, 10 | jaod 873 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∨ 𝑋 = 𝑌) → (𝑌 < 𝑍 → 𝑋 < 𝑍))) |
| 12 | 5, 11 | sylbid 243 | . 2 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑌 → (𝑌 < 𝑍 → 𝑋 < 𝑍))) |
| 13 | 12 | impd 416 | 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 5103 ‘cfv 6533 Basecbs 17301 lecple 17349 Posetcpo 18395 ltcplt 18396 |
| 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 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6489 df-fun 6535 df-fv 6541 df-proset 18382 df-poset 18401 df-plt 18416 |
| This theorem is used by: isarchi3 33627 archiabllem2c 33635 athgt 40329 1cvratex 40346 |
| Copyright terms: Public domain | W3C validator |