HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem nsspssun 2826
Description: Negation of subclass expressed in terms of proper subclass and union.
Assertion
Ref Expression
nsspssun |- (-. A C_ B <-> B C. (A u. B))

Proof of Theorem nsspssun
StepHypRef Expression
1 ssun2 2768 . . 3 |- B C_ (A u. B)
21biantrur 794 . 2 |- (-. (A u. B) C_ B <-> (B C_ (A u. B) /\ -. (A u. B) C_ B))
3 ssid 2634 . . . . 5 |- B C_ B
43biantru 793 . . . 4 |- (A C_ B <-> (A C_ B /\ B C_ B))
5 unss 2780 . . . 4 |- ((A C_ B /\ B C_ B) <-> (A u. B) C_ B)
64, 5bitri 190 . . 3 |- (A C_ B <-> (A u. B) C_ B)
76notbii 204 . 2 |- (-. A C_ B <-> -. (A u. B) C_ B)
8 dfpss3 2695 . 2 |- (B C. (A u. B) <-> (B C_ (A u. B) /\ -. (A u. B) C_ B))
92, 7, 83bitr4i 200 1 |- (-. A C_ B <-> B C. (A u. B))
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 163   /\ wa 240   u. cun 2591   C_ wss 2593   C. wpss 2594
This theorem is referenced by:  disjpss 2924
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-un 2600  df-in 2603  df-ss 2605  df-pss 2607
Copyright terms: Public domain