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

Theorem nssinpss 4219
Description: Negation of subclass expressed in terms of intersection and proper subclass. (Contributed by NM, 30-Jun-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
nssinpss 𝐴𝐵 ↔ (𝐴𝐵) ⊊ 𝐴)

Proof of Theorem nssinpss
StepHypRef Expression
1 inss1 4188 . . 3 (𝐴𝐵) ⊆ 𝐴
21biantrur 538 . 2 ((𝐴𝐵) ≠ 𝐴 ↔ ((𝐴𝐵) ⊆ 𝐴 ∧ (𝐴𝐵) ≠ 𝐴))
3 dfss2 3922 . . 3 (𝐴𝐵 ↔ (𝐴𝐵) = 𝐴)
43necon3bbii 3003 . 2 𝐴𝐵 ↔ (𝐴𝐵) ≠ 𝐴)
5 df-pss 3924 . 2 ((𝐴𝐵) ⊊ 𝐴 ↔ ((𝐴𝐵) ⊆ 𝐴 ∧ (𝐴𝐵) ≠ 𝐴))
62, 4, 53bitr4i 305 1 𝐴𝐵 ↔ (𝐴𝐵) ⊊ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wa 399  wne 2956  cin 3903  wss 3904  wpss 3905
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733
This theorem depends on definitions:  df-bi 209  df-an 400  df-3an 1099  df-tru 1562  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-v 3455  df-in 3911  df-ss 3921  df-pss 3924
This theorem is referenced by:  fbfinnfr  23881  chrelat2i  32514
  Copyright terms: Public domain W3C validator