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

Theorem unrab 2270
Description: Union of two restricted class abstractions.
Assertion
Ref Expression
unrab |- ({x e. A | ph} u. {x e. A | ps}) = {x e. A | (ph \/ ps)}

Proof of Theorem unrab
StepHypRef Expression
1 unab 2267 . . 3 |- ({x | (x e. A /\ ph)} u. {x | (x e. A /\ ps)}) = {x | ((x e. A /\ ph) \/ (x e. A /\ ps))}
2 andi 604 . . . 4 |- ((x e. A /\ (ph \/ ps)) <-> ((x e. A /\ ph) \/ (x e. A /\ ps)))
32abbii 1575 . . 3 |- {x | (x e. A /\ (ph \/ ps))} = {x | ((x e. A /\ ph) \/ (x e. A /\ ps))}
41, 3eqtr4 1498 . 2 |- ({x | (x e. A /\ ph)} u. {x | (x e. A /\ ps)}) = {x | (x e. A /\ (ph \/ ps))}
5 df-rab 1652 . . 3 |- {x e. A | ph} = {x | (x e. A /\ ph)}
6 df-rab 1652 . . 3 |- {x e. A | ps} = {x | (x e. A /\ ps)}
75, 6uneq12i 2182 . 2 |- ({x e. A | ph} u. {x e. A | ps}) = ({x | (x e. A /\ ph)} u. {x | (x e. A /\ ps)})
8 df-rab 1652 . 2 |- {x e. A | (ph \/ ps)} = {x | (x e. A /\ (ph \/ ps))}
94, 7, 83eqtr4 1505 1 |- ({x e. A | ph} u. {x e. A | ps}) = {x e. A | (ph \/ ps)}
Colors of variables: wff set class
Syntax hints:   \/ wo 222   /\ wa 223   = wceq 956   e. wcel 958  {cab 1463  {crab 1648   u. cun 2045
This theorem is referenced by:  kmlem3 4767
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-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-rab 1652  df-v 1812  df-un 2050
Copyright terms: Public domain