| 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 4045 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 2740 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | pltnlt.s | . . . . . 6 ⊢ < = (lt‘𝐾) | |
| 3 | 1, 2 | pltle 18295 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 → 𝑋(le‘𝐾)𝑌)) |
| 4 | 3 | 3adant3r3 1191 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 < 𝑌 → 𝑋(le‘𝐾)𝑌)) |
| 5 | 1, 2 | pltle 18295 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 < 𝑍 → 𝑌(le‘𝐾)𝑍)) |
| 6 | 5 | 3adant3r1 1189 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 < 𝑍 → 𝑌(le‘𝐾)𝑍)) |
| 7 | pltnlt.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 8 | 7, 1 | postr 18284 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋(le‘𝐾)𝑌 ∧ 𝑌(le‘𝐾)𝑍) → 𝑋(le‘𝐾)𝑍)) |
| 9 | 4, 6, 8 | syl2and 614 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋(le‘𝐾)𝑍)) |
| 10 | 7, 2 | pltn2lp 18303 | . . . . . 6 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋)) |
| 11 | 10 | 3adant3r3 1191 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋)) |
| 12 | breq2 5083 | . . . . . . 7 ⊢ (𝑋 = 𝑍 → (𝑌 < 𝑋 ↔ 𝑌 < 𝑍)) | |
| 13 | 12 | anbi2d 636 | . . . . . 6 ⊢ (𝑋 = 𝑍 → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑋) ↔ (𝑋 < 𝑌 ∧ 𝑌 < 𝑍))) |
| 14 | 13 | notbid 319 | . . . . 5 ⊢ (𝑋 = 𝑍 → (¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋) ↔ ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑍))) |
| 15 | 11, 14 | syl5ibcom 246 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 = 𝑍 → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑍))) |
| 16 | 15 | necon2ad 2950 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 ≠ 𝑍)) |
| 17 | 9, 16 | jcad 517 | . 2 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → (𝑋(le‘𝐾)𝑍 ∧ 𝑋 ≠ 𝑍))) |
| 18 | 1, 2 | pltval 18294 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 < 𝑍 ↔ (𝑋(le‘𝐾)𝑍 ∧ 𝑋 ≠ 𝑍))) |
| 19 | 18 | 3adant3r2 1190 | . 2 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 < 𝑍 ↔ (𝑋(le‘𝐾)𝑍 ∧ 𝑋 ≠ 𝑍))) |
| 20 | 17, 19 | sylibrd 260 | 1 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 < 𝑍) → 𝑋 < 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 class class class wbr 5079 ‘cfv 6492 Basecbs 17177 lecple 17225 Posetcpo 18271 ltcplt 18272 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-sbc 3731 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6448 df-fun 6494 df-fv 6500 df-proset 18258 df-poset 18277 df-plt 18292 |
| This theorem is referenced by: pltletr 18305 plelttr 18306 pospo 18307 ofldchr 21558 archiabllem2c 33283 hlhgt2 39888 hl0lt1N 39889 lhp0lt 40502 |
| Copyright terms: Public domain | W3C validator |