| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pltn2lp | Structured version Visualization version GIF version | ||
| Description: The less-than relation has no 2-cycle loops. (pssn2lp 4060 analog.) (Contributed by NM, 2-Dec-2011.) |
| Ref | Expression |
|---|---|
| pltnlt.b | ⊢ 𝐵 = (Base‘𝐾) |
| pltnlt.s | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| pltn2lp | ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pltnlt.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | eqid 2765 | . . . . 5 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 3 | pltnlt.s | . . . . 5 ⊢ < = (lt‘𝐾) | |
| 4 | 1, 2, 3 | pltnle 18414 | . . . 4 ⊢ (((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 < 𝑌) → ¬ 𝑌(le‘𝐾)𝑋) |
| 5 | 4 | ex 418 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 → ¬ 𝑌(le‘𝐾)𝑋)) |
| 6 | 2, 3 | pltle 18409 | . . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 < 𝑋 → 𝑌(le‘𝐾)𝑋)) |
| 7 | 6 | 3com23 1144 | . . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 < 𝑋 → 𝑌(le‘𝐾)𝑋)) |
| 8 | 5, 7 | nsyld 157 | . 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 → ¬ 𝑌 < 𝑋)) |
| 9 | imnan 405 | . 2 ⊢ ((𝑋 < 𝑌 → ¬ 𝑌 < 𝑋) ↔ ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋)) | |
| 10 | 8, 9 | sylib 221 | 1 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 class class class wbr 5111 ‘cfv 6540 Basecbs 17291 lecple 17339 Posetcpo 18385 ltcplt 18386 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-proset 18372 df-poset 18391 df-plt 18406 |
| This theorem is used by: plttr 18418 |
| Copyright terms: Public domain | W3C validator |