pltn2lp - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pltn2lp		Structured version Visualization version GIF version

Theorem pltn2lp 18356

Description: The less-than relation has no 2-cycle loops. (pssn2lp 4084 analog.) (Contributed by NM, 2-Dec-2011.)

**Hypotheses**
Ref	Expression
pltnlt.b	⊢ 𝐵 = (Base‘𝐾)
pltnlt.s	⊢ < = (lt‘𝐾)

**Assertion**
Ref	Expression
pltn2lp	⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋))

**Proof of Theorem pltn2lp**
Step	Hyp	Ref	Expression
1		pltnlt.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
2		eqid 2736	. . . . 5 ⊢ (le‘𝐾) = (le‘𝐾)
3		pltnlt.s	. . . . 5 ⊢ < = (lt‘𝐾)
4	1, 2, 3	pltnle 18353	. . . 4 ⊢ (((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 < 𝑌) → ¬ 𝑌(le‘𝐾)𝑋)
5	4	ex 412	. . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 → ¬ 𝑌(le‘𝐾)𝑋))
6	2, 3	pltle 18348	. . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 < 𝑋 → 𝑌(le‘𝐾)𝑋))
7	6	3com23 1126	. . 3 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 < 𝑋 → 𝑌(le‘𝐾)𝑋))
8	5, 7	nsyld 156	. 2 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 < 𝑌 → ¬ 𝑌 < 𝑋))
9		imnan 399	. 2 ⊢ ((𝑋 < 𝑌 → ¬ 𝑌 < 𝑋) ↔ ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋))
10	8, 9	sylib 218	1 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ¬ (𝑋 < 𝑌 ∧ 𝑌 < 𝑋))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 class class class wbr 5124 ‘cfv 6536 Basecbs 17233 lecple 17283 Posetcpo 18324 ltcplt 18325

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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407

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 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6489 df-fun 6538 df-fv 6544 df-proset 18311 df-poset 18330 df-plt 18345

This theorem is referenced by: plttr 18357

W3C validator