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

Theorem pssn2lp 4032
Description: Proper subclass has no 2-cycle loops. Compare Theorem 8 of [Suppes] p. 23. (Contributed by NM, 7-Feb-1996.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
pssn2lp ¬ (𝐴 ⊊ 𝐵 ∧ 𝐵 ⊊ 𝐴)

Proof of Theorem pssn2lp
StepHypRef Expression
1 dfpss3 4016 . . . 4 (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐵 ⊆ 𝐴))
21simprbi 503 . . 3 (𝐴 ⊊ 𝐵 → ¬ 𝐵 ⊆ 𝐴)
3 pssss 4025 . . 3 (𝐵 ⊊ 𝐴 → 𝐵 ⊆ 𝐴)
42, 3nsyl 141 . 2 (𝐴 ⊊ 𝐵 → ¬ 𝐵 ⊊ 𝐴)
5 imnan 405 . 2 ((𝐴 ⊊ 𝐵 → ¬ 𝐵 ⊊ 𝐴) ↔ ¬ (𝐴 ⊊ 𝐵 ∧ 𝐵 ⊊ 𝐴))
64, 5mpbi 233 1 ¬ (𝐴 ⊊ 𝐵 ∧ 𝐵 ⊊ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ⊆ wss 3895   ⊊ wpss 4013
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-cleq 2752  df-ne 2956  df-ss 3896  df-pss 4014
This theorem is used by:  psstr  4035  cvnsym  32897
  Copyright terms: Public domain W3C validator