MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  symdif2 Unicode version

Theorem symdif2 3434
Description: Two ways to express symmetric difference. (Contributed by NM, 17-Aug-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
symdif2  |-  ( ( A  \  B )  u.  ( B  \  A ) )  =  { x  |  -.  ( x  e.  A  <->  x  e.  B ) }
Distinct variable groups:    x, A    x, B

Proof of Theorem symdif2
StepHypRef Expression
1 eldif 3162 . . . 4  |-  ( x  e.  ( A  \  B )  <->  ( x  e.  A  /\  -.  x  e.  B ) )
2 eldif 3162 . . . 4  |-  ( x  e.  ( B  \  A )  <->  ( x  e.  B  /\  -.  x  e.  A ) )
31, 2orbi12i 507 . . 3  |-  ( ( x  e.  ( A 
\  B )  \/  x  e.  ( B 
\  A ) )  <-> 
( ( x  e.  A  /\  -.  x  e.  B )  \/  (
x  e.  B  /\  -.  x  e.  A
) ) )
4 elun 3316 . . 3  |-  ( x  e.  ( ( A 
\  B )  u.  ( B  \  A
) )  <->  ( x  e.  ( A  \  B
)  \/  x  e.  ( B  \  A
) ) )
5 xor 861 . . 3  |-  ( -.  ( x  e.  A  <->  x  e.  B )  <->  ( (
x  e.  A  /\  -.  x  e.  B
)  \/  ( x  e.  B  /\  -.  x  e.  A )
) )
63, 4, 53bitr4i 268 . 2  |-  ( x  e.  ( ( A 
\  B )  u.  ( B  \  A
) )  <->  -.  (
x  e.  A  <->  x  e.  B ) )
76abbi2i 2394 1  |-  ( ( A  \  B )  u.  ( B  \  A ) )  =  { x  |  -.  ( x  e.  A  <->  x  e.  B ) }
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 176    \/ wo 357    /\ wa 358    = wceq 1623    e. wcel 1684   {cab 2269    \ cdif 3149    u. cun 3150
This theorem is referenced by:  mbfeqalem  18997
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-v 2790  df-dif 3155  df-un 3157
  Copyright terms: Public domain W3C validator