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

Theorem rabswap 1771
Description: Swap with a membership relation in a restricted class abstraction.
Assertion
Ref Expression
rabswap |- {x e. A | x e. B} = {x e. B | x e. A}

Proof of Theorem rabswap
StepHypRef Expression
1 ancom 435 . . 3 |- ((x e. A /\ x e. B) <-> (x e. B /\ x e. A))
21abbii 1575 . 2 |- {x | (x e. A /\ x e. B)} = {x | (x e. B /\ x e. A)}
3 df-rab 1652 . 2 |- {x e. A | x e. B} = {x | (x e. A /\ x e. B)}
4 df-rab 1652 . 2 |- {x e. B | x e. A} = {x | (x e. B /\ x e. A)}
52, 3, 43eqtr4 1505 1 |- {x e. A | x e. B} = {x e. B | x e. A}
Colors of variables: wff set class
Syntax hints:   /\ wa 223   = wceq 956   e. wcel 958  {cab 1463  {crab 1648
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-rab 1652
Copyright terms: Public domain