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

Theorem ssnpss 4037
Description: Partial trichotomy law for subclasses. (Contributed by NM, 16-May-1996.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
ssnpss (𝐴 ⊆ 𝐵 → ¬ 𝐵 ⊊ 𝐴)

Proof of Theorem ssnpss
StepHypRef Expression
1 dfpss3 4019 . . 3 (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐴 ⊆ 𝐵))
21simprbi 503 . 2 (𝐵 ⊊ 𝐴 → ¬ 𝐴 ⊆ 𝐵)
32con2i 140 1 (𝐴 ⊆ 𝐵 → ¬ 𝐵 ⊊ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ⊆ wss 3900   ⊊ wpss 4016
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 1945  ax-6 2002  ax-7 2043  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2755  df-ne 2960  df-ss 3901  df-pss 4017
This theorem is used by:  npss0  4364  nvpss  4366  sorpssuni  7775  sorpssint  7776  suplem2pr  11168  symgvalstruct  19644  lsppratlem6  21463  atcvati  33021  finxpreclem3  38521  lsatcvat  40310
  Copyright terms: Public domain W3C validator