ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ddifss Unicode version

Theorem ddifss 3419
Description: Double complement under universal class. In classical logic (or given an additional hypothesis, as in ddifnel 3312), this is equality rather than subset. (Contributed by Jim Kingdon, 24-Jul-2018.)
Assertion
Ref Expression
ddifss  |-  A  C_  ( _V  \  ( _V  \  A ) )

Proof of Theorem ddifss
StepHypRef Expression
1 ssv 3223 . 2  |-  A  C_  _V
2 ssddif 3415 . 2  |-  ( A 
C_  _V  <->  A  C_  ( _V 
\  ( _V  \  A ) ) )
31, 2mpbi 145 1  |-  A  C_  ( _V  \  ( _V  \  A ) )
Colors of variables: wff set class
Syntax hints:   _Vcvv 2776    \ cdif 3171    C_ wss 3174
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-dif 3176  df-in 3180  df-ss 3187
This theorem is referenced by:  ssindif0im  3528  difdifdirss  3553
  Copyright terms: Public domain W3C validator