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

Theorem reldisj 3543
Description: Two ways of saying that two classes are disjoint, using the complement of  B relative to a universe  C. (Contributed by NM, 15-Feb-2007.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
reldisj  |-  ( A 
C_  C  ->  (
( A  i^i  B
)  =  (/)  <->  A  C_  ( C  \  B ) ) )

Proof of Theorem reldisj
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ssalel 3212 . . . 4  |-  ( A 
C_  C  <->  A. x
( x  e.  A  ->  x  e.  C ) )
2 pm5.44 930 . . . . . 6  |-  ( ( x  e.  A  ->  x  e.  C )  ->  ( ( x  e.  A  ->  -.  x  e.  B )  <->  ( x  e.  A  ->  ( x  e.  C  /\  -.  x  e.  B )
) ) )
3 eldif 3206 . . . . . . 7  |-  ( x  e.  ( C  \  B )  <->  ( x  e.  C  /\  -.  x  e.  B ) )
43imbi2i 226 . . . . . 6  |-  ( ( x  e.  A  ->  x  e.  ( C  \  B ) )  <->  ( x  e.  A  ->  ( x  e.  C  /\  -.  x  e.  B )
) )
52, 4bitr4di 198 . . . . 5  |-  ( ( x  e.  A  ->  x  e.  C )  ->  ( ( x  e.  A  ->  -.  x  e.  B )  <->  ( x  e.  A  ->  x  e.  ( C  \  B
) ) ) )
65sps 1583 . . . 4  |-  ( A. x ( x  e.  A  ->  x  e.  C )  ->  (
( x  e.  A  ->  -.  x  e.  B
)  <->  ( x  e.  A  ->  x  e.  ( C  \  B ) ) ) )
71, 6sylbi 121 . . 3  |-  ( A 
C_  C  ->  (
( x  e.  A  ->  -.  x  e.  B
)  <->  ( x  e.  A  ->  x  e.  ( C  \  B ) ) ) )
87albidv 1870 . 2  |-  ( A 
C_  C  ->  ( A. x ( x  e.  A  ->  -.  x  e.  B )  <->  A. x
( x  e.  A  ->  x  e.  ( C 
\  B ) ) ) )
9 disj1 3542 . 2  |-  ( ( A  i^i  B )  =  (/)  <->  A. x ( x  e.  A  ->  -.  x  e.  B )
)
10 ssalel 3212 . 2  |-  ( A 
C_  ( C  \  B )  <->  A. x
( x  e.  A  ->  x  e.  ( C 
\  B ) ) )
118, 9, 103bitr4g 223 1  |-  ( A 
C_  C  ->  (
( A  i^i  B
)  =  (/)  <->  A  C_  ( C  \  B ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1393    = wceq 1395    e. wcel 2200    \ cdif 3194    i^i cin 3196    C_ wss 3197   (/)c0 3491
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2801  df-dif 3199  df-in 3203  df-ss 3210  df-nul 3492
This theorem is referenced by:  disj2  3547  ssdifsn  3795  structcnvcnv  13043
  Copyright terms: Public domain W3C validator