| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plttr | Structured version Visualization version GIF version | ||
| Description: The less-than relation is transitive. (psstr 4082 analog.) (Contributed by NM, 2-Dec-2011.) |
| Ref | Expression |
|---|---|
| pltnlt.b | ⊢ 𝐵 = (Base‘𝐾) |
| pltnlt.s | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| plttr | ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2735 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | pltnlt.s | . . . . . 6 ⊢ < = (lt‘𝐾) | |
| 3 | 1, 2 | pltle 18343 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 → 𝑋(le‘𝐾)𝑌)) |
| 4 | 3 | 3adant3r3 1185 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 < 𝑌 → 𝑋(le‘𝐾)𝑌)) |
| 5 | 1, 2 | pltle 18343 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 < 𝑍 → 𝑌(le‘𝐾)𝑍)) |
| 6 | 5 | 3adant3r1 1183 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 < 𝑍 → 𝑌(le‘𝐾)𝑍)) |
| 7 | pltnlt.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 8 | 7, 1 | postr 18332 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋(le‘𝐾)𝑌 ∧ 𝑌(le‘𝐾)𝑍) → 𝑋(le‘𝐾)𝑍)) |
| 9 | 4, 6, 8 | syl2and 608 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋(le‘𝐾)𝑍)) |
| 10 | 7, 2 | pltn2lp 18351 | . . . . . 6 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋)) |
| 11 | 10 | 3adant3r3 1185 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋)) |
| 12 | breq2 5123 | . . . . . . 7 ⊢ (𝑋 = 𝑍 → (𝑌 < 𝑋 ↔ 𝑌 < 𝑍)) | |
| 13 | 12 | anbi2d 630 | . . . . . 6 ⊢ (𝑋 = 𝑍 → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑋) ↔ (𝑋 < 𝑌 ∧ 𝑌 < 𝑍))) |
| 14 | 13 | notbid 318 | . . . . 5 ⊢ (𝑋 = 𝑍 → (¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋) ↔ ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑍))) |
| 15 | 11, 14 | syl5ibcom 245 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 = 𝑍 → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑍))) |
| 16 | 15 | necon2ad 2947 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 ≠ 𝑍)) |
| 17 | 9, 16 | jcad 512 | . 2 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → (𝑋(le‘𝐾)𝑍 ∧ 𝑋 ≠ 𝑍))) |
| 18 | 1, 2 | pltval 18342 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 < 𝑍 ↔ (𝑋(le‘𝐾)𝑍 ∧ 𝑋 ≠ 𝑍))) |
| 19 | 18 | 3adant3r2 1184 | . 2 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 < 𝑍 ↔ (𝑋(le‘𝐾)𝑍 ∧ 𝑋 ≠ 𝑍))) |
| 20 | 17, 19 | sylibrd 259 | 1 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 class class class wbr 5119 ‘cfv 6531 Basecbs 17228 lecple 17278 Posetcpo 18319 ltcplt 18320 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-sbc 3766 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-iota 6484 df-fun 6533 df-fv 6539 df-proset 18306 df-poset 18325 df-plt 18340 |
| This theorem is referenced by: pltletr 18353 plelttr 18354 pospo 18355 archiabllem2c 33193 ofldchr 33336 hlhgt2 39408 hl0lt1N 39409 lhp0lt 40022 |
| Copyright terms: Public domain | W3C validator |