Theorem ralun 3391

Description: Restricted quantification over union. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
ralun	|- ( ( A. x e. A ph /\ A. x e. B ph ) -> A. x e. ( A u. B ) ph )

Proof of Theorem ralun

Step	Hyp	Ref	Expression
1		ralunb 3390	. 2 |- ( A. x e. ( A u. B ) ph <-> ( A. x e. A ph /\ A. x e. B ph ) )
2	1	biimpri 133	1 |- ( ( A. x e. A ph /\ A. x e. B ph ) -> A. x e. ( A u. B ) ph )

Syntax hints:   -> wi 4   /\ wa 104   A.wral 2511   u. cun 3199

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-v 2805  df-un 3205

This theorem is referenced by:  omsinds  4726  ac6sfi  7130  fimax2gtrilemstep  7133  finomni  7399  uzsinds  10769  iseqf1olemqk  10832  seq3f1olemstep  10839  fimaxre2  11867  modfsummod  12099