Theorem unrab 3443

Description: Union of two restricted class abstractions. (Contributed by NM, 25-Mar-2004.)

Assertion

Ref	Expression
unrab	|- ( { x e. A | ph } u. { x e. A | ps } ) = { x e. A | ( ph \/ ps ) }

Proof of Theorem unrab

Step	Hyp	Ref	Expression
1		df-rab 2492	. . 3 |- { x e. A | ph } = { x | ( x e. A /\ ph ) }
2		df-rab 2492	. . 3 |- { x e. A | ps } = { x | ( x e. A /\ ps ) }
3	1, 2	uneq12i 3324	. 2 |- ( { x e. A | ph } u. { x e. A | ps } ) = ( { x | ( x e. A /\ ph ) } u. { x | ( x e. A /\ ps ) } )
4		df-rab 2492	. . 3 |- { x e. A | ( ph \/ ps ) } = { x | ( x e. A /\ ( ph \/ ps ) ) }
5		unab 3439	. . . 4 |- ( { x | ( x e. A /\ ph ) } u. { x | ( x e. A /\ ps ) } ) = { x | ( ( x e. A /\ ph ) \/ ( x e. A /\ ps ) ) }
6		andi 819	. . . . 5 |- ( ( x e. A /\ ( ph \/ ps ) ) <-> ( ( x e. A /\ ph ) \/ ( x e. A /\ ps ) ) )
7	6	abbii 2320	. . . 4 |- { x | ( x e. A /\ ( ph \/ ps ) ) } = { x | ( ( x e. A /\ ph ) \/ ( x e. A /\ ps ) ) }
8	5, 7	eqtr4i 2228	. . 3 |- ( { x | ( x e. A /\ ph ) } u. { x | ( x e. A /\ ps ) } ) = { x | ( x e. A /\ ( ph \/ ps ) ) }
9	4, 8	eqtr4i 2228	. 2 |- { x e. A | ( ph \/ ps ) } = ( { x | ( x e. A /\ ph ) } u. { x | ( x e. A /\ ps ) } )
10	3, 9	eqtr4i 2228	1 |- ( { x e. A | ph } u. { x e. A | ps } ) = { x e. A | ( ph \/ ps ) }

Syntax hints:   /\ wa 104   \/ wo 709   = wceq 1372   e. wcel 2175   {cab 2190   {crab 2487   u. cun 3163

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-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186

This theorem depends on definitions:  df-bi 117  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-rab 2492  df-v 2773  df-un 3169

This theorem is referenced by:  rabxmdc  3491  phiprmpw  12515  unennn  12739  znnen  12740  lgsquadlem2  15526