Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  unipreima Structured version   Visualization version   Unicode version

Theorem unipreima 29446
Description: Preimage of a class union. (Contributed by Thierry Arnoux, 7-Feb-2017.)
Assertion
Ref Expression
unipreima  |-  ( Fun 
F  ->  ( `' F " U. A )  =  U_ x  e.  A  ( `' F " x ) )
Distinct variable groups:    x, F    x, A

Proof of Theorem unipreima
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 funfn 5918 . 2  |-  ( Fun 
F  <->  F  Fn  dom  F )
2 r19.42v 3092 . . . . . . 7  |-  ( E. x  e.  A  ( y  e.  dom  F  /\  ( F `  y
)  e.  x )  <-> 
( y  e.  dom  F  /\  E. x  e.  A  ( F `  y )  e.  x
) )
32bicomi 214 . . . . . 6  |-  ( ( y  e.  dom  F  /\  E. x  e.  A  ( F `  y )  e.  x )  <->  E. x  e.  A  ( y  e.  dom  F  /\  ( F `  y )  e.  x ) )
43a1i 11 . . . . 5  |-  ( F  Fn  dom  F  -> 
( ( y  e. 
dom  F  /\  E. x  e.  A  ( F `  y )  e.  x
)  <->  E. x  e.  A  ( y  e.  dom  F  /\  ( F `  y )  e.  x
) ) )
5 eluni2 4440 . . . . . . 7  |-  ( ( F `  y )  e.  U. A  <->  E. x  e.  A  ( F `  y )  e.  x
)
65anbi2i 730 . . . . . 6  |-  ( ( y  e.  dom  F  /\  ( F `  y
)  e.  U. A
)  <->  ( y  e. 
dom  F  /\  E. x  e.  A  ( F `  y )  e.  x
) )
76a1i 11 . . . . 5  |-  ( F  Fn  dom  F  -> 
( ( y  e. 
dom  F  /\  ( F `  y )  e.  U. A )  <->  ( y  e.  dom  F  /\  E. x  e.  A  ( F `  y )  e.  x ) ) )
8 elpreima 6337 . . . . . 6  |-  ( F  Fn  dom  F  -> 
( y  e.  ( `' F " x )  <-> 
( y  e.  dom  F  /\  ( F `  y )  e.  x
) ) )
98rexbidv 3052 . . . . 5  |-  ( F  Fn  dom  F  -> 
( E. x  e.  A  y  e.  ( `' F " x )  <->  E. x  e.  A  ( y  e.  dom  F  /\  ( F `  y )  e.  x
) ) )
104, 7, 93bitr4d 300 . . . 4  |-  ( F  Fn  dom  F  -> 
( ( y  e. 
dom  F  /\  ( F `  y )  e.  U. A )  <->  E. x  e.  A  y  e.  ( `' F " x ) ) )
11 elpreima 6337 . . . 4  |-  ( F  Fn  dom  F  -> 
( y  e.  ( `' F " U. A
)  <->  ( y  e. 
dom  F  /\  ( F `  y )  e.  U. A ) ) )
12 eliun 4524 . . . . 5  |-  ( y  e.  U_ x  e.  A  ( `' F " x )  <->  E. x  e.  A  y  e.  ( `' F " x ) )
1312a1i 11 . . . 4  |-  ( F  Fn  dom  F  -> 
( y  e.  U_ x  e.  A  ( `' F " x )  <->  E. x  e.  A  y  e.  ( `' F " x ) ) )
1410, 11, 133bitr4d 300 . . 3  |-  ( F  Fn  dom  F  -> 
( y  e.  ( `' F " U. A
)  <->  y  e.  U_ x  e.  A  ( `' F " x ) ) )
1514eqrdv 2620 . 2  |-  ( F  Fn  dom  F  -> 
( `' F " U. A )  =  U_ x  e.  A  ( `' F " x ) )
161, 15sylbi 207 1  |-  ( Fun 
F  ->  ( `' F " U. A )  =  U_ x  e.  A  ( `' F " x ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   E.wrex 2913   U.cuni 4436   U_ciun 4520   `'ccnv 5113   dom cdm 5114   "cima 5117   Fun wfun 5882    Fn wfn 5883   ` cfv 5888
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-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  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-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-fv 5896
This theorem is referenced by:  imambfm  30324  dstrvprob  30533
  Copyright terms: Public domain W3C validator