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

Theorem ralun 3685
Description: Restricted quantification over union. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
ralun

Proof of Theorem ralun
StepHypRef Expression
1 ralunb 3684 . 2
21biimpri 206 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  /\wa 369  A.wral 2807  u.cun 3473
This theorem is referenced by:  ac6sfi  7784  frfi  7785  fpwwe2lem13  9041  modfsummod  13608  drsdirfi  15567  lbsextlem4  17807  fbun  20341  filcon  20384  cnmpt2pc  21428  chtub  23487  eupap1  24976  prsiga  28131  finixpnum  30038  kelac1  31009
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ral 2812  df-v 3111  df-un 3480
  Copyright terms: Public domain W3C validator