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

Theorem nssinpss 4157
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 4129 . . 3 (𝐴𝐵) ⊆ 𝐴
21biantrur 534 . 2 ((𝐴𝐵) ≠ 𝐴 ↔ ((𝐴𝐵) ⊆ 𝐴 ∧ (𝐴𝐵) ≠ 𝐴))
3 df-ss 3870 . . 3 (𝐴𝐵 ↔ (𝐴𝐵) = 𝐴)
43necon3bbii 2979 . 2 𝐴𝐵 ↔ (𝐴𝐵) ≠ 𝐴)
5 df-pss 3872 . 2 ((𝐴𝐵) ⊊ 𝐴 ↔ ((𝐴𝐵) ⊆ 𝐴 ∧ (𝐴𝐵) ≠ 𝐴))
62, 4, 53bitr4i 306 1 𝐴𝐵 ↔ (𝐴𝐵) ⊊ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 209  wa 399  wne 2932  cin 3852  wss 3853  wpss 3854
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-ext 2708
This theorem depends on definitions:  df-bi 210  df-an 400  df-tru 1546  df-ex 1788  df-sb 2073  df-clab 2715  df-cleq 2728  df-clel 2809  df-ne 2933  df-v 3400  df-in 3860  df-ss 3870  df-pss 3872
This theorem is referenced by:  fbfinnfr  22692  chrelat2i  30400
  Copyright terms: Public domain W3C validator