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

Theorem dfiun3 5380
Description: Alternate definition of indexed union when  B is a set. (Contributed by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
dfiun3.1  |-  B  e. 
_V
Assertion
Ref Expression
dfiun3  |-  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B )

Proof of Theorem dfiun3
StepHypRef Expression
1 dfiun3g 5378 . 2  |-  ( A. x  e.  A  B  e.  _V  ->  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B ) )
2 dfiun3.1 . . 3  |-  B  e. 
_V
32a1i 11 . 2  |-  ( x  e.  A  ->  B  e.  _V )
41, 3mprg 2926 1  |-  U_ x  e.  A  B  =  U. ran  ( x  e.  A  |->  B )
Colors of variables: wff setvar class
Syntax hints:    = wceq 1483    e. wcel 1990   _Vcvv 3200   U.cuni 4436   U_ciun 4520    |-> cmpt 4729   ran crn 5115
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-cnv 5122  df-dm 5124  df-rn 5125
This theorem is referenced by:  tgrest  20963  comppfsc  21335  sigapildsys  30225  ldgenpisyslem1  30226  dstfrvunirn  30536  mblfinlem2  33447  volsupnfl  33454  istotbnd3  33570  sstotbnd  33574  fourierdlem80  40403
  Copyright terms: Public domain W3C validator