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

Theorem elunirn 6171
Description: Membership in the union of the range of a function. See elunirnALT 6172 for a shorter proof which uses ax-pow 4602. (Contributed by NM, 24-Sep-2006.)
Assertion
Ref Expression
elunirn  |-  ( Fun 
F  ->  ( A  e.  U. ran  F  <->  E. x  e.  dom  F  A  e.  ( F `  x
) ) )
Distinct variable groups:    x, A    x, F

Proof of Theorem elunirn
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eluni 4222 . 2  |-  ( A  e.  U. ran  F  <->  E. y ( A  e.  y  /\  y  e. 
ran  F ) )
2 funfn 5630 . . . . . . . 8  |-  ( Fun 
F  <->  F  Fn  dom  F )
3 fvelrnb 5928 . . . . . . . 8  |-  ( F  Fn  dom  F  -> 
( y  e.  ran  F  <->  E. x  e.  dom  F ( F `  x
)  =  y ) )
42, 3sylbi 198 . . . . . . 7  |-  ( Fun 
F  ->  ( y  e.  ran  F  <->  E. x  e.  dom  F ( F `
 x )  =  y ) )
54anbi2d 708 . . . . . 6  |-  ( Fun 
F  ->  ( ( A  e.  y  /\  y  e.  ran  F )  <-> 
( A  e.  y  /\  E. x  e. 
dom  F ( F `
 x )  =  y ) ) )
6 r19.42v 2980 . . . . . 6  |-  ( E. x  e.  dom  F
( A  e.  y  /\  ( F `  x )  =  y )  <->  ( A  e.  y  /\  E. x  e.  dom  F ( F `
 x )  =  y ) )
75, 6syl6bbr 266 . . . . 5  |-  ( Fun 
F  ->  ( ( A  e.  y  /\  y  e.  ran  F )  <->  E. x  e.  dom  F ( A  e.  y  /\  ( F `  x )  =  y ) ) )
8 eleq2 2496 . . . . . . 7  |-  ( ( F `  x )  =  y  ->  ( A  e.  ( F `  x )  <->  A  e.  y ) )
98biimparc 489 . . . . . 6  |-  ( ( A  e.  y  /\  ( F `  x )  =  y )  ->  A  e.  ( F `  x ) )
109reximi 2890 . . . . 5  |-  ( E. x  e.  dom  F
( A  e.  y  /\  ( F `  x )  =  y )  ->  E. x  e.  dom  F  A  e.  ( F `  x
) )
117, 10syl6bi 231 . . . 4  |-  ( Fun 
F  ->  ( ( A  e.  y  /\  y  e.  ran  F )  ->  E. x  e.  dom  F  A  e.  ( F `
 x ) ) )
1211exlimdv 1772 . . 3  |-  ( Fun 
F  ->  ( E. y ( A  e.  y  /\  y  e. 
ran  F )  ->  E. x  e.  dom  F  A  e.  ( F `
 x ) ) )
13 fvelrn 6030 . . . . . . 7  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  ran  F
)
1413a1d 26 . . . . . 6  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( A  e.  ( F `  x )  ->  ( F `  x )  e.  ran  F ) )
1514ancld 555 . . . . 5  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( A  e.  ( F `  x )  ->  ( A  e.  ( F `  x
)  /\  ( F `  x )  e.  ran  F ) ) )
16 fvex 5891 . . . . . 6  |-  ( F `
 x )  e. 
_V
17 eleq2 2496 . . . . . . 7  |-  ( y  =  ( F `  x )  ->  ( A  e.  y  <->  A  e.  ( F `  x ) ) )
18 eleq1 2495 . . . . . . 7  |-  ( y  =  ( F `  x )  ->  (
y  e.  ran  F  <->  ( F `  x )  e.  ran  F ) )
1917, 18anbi12d 715 . . . . . 6  |-  ( y  =  ( F `  x )  ->  (
( A  e.  y  /\  y  e.  ran  F )  <->  ( A  e.  ( F `  x
)  /\  ( F `  x )  e.  ran  F ) ) )
2016, 19spcev 3173 . . . . 5  |-  ( ( A  e.  ( F `
 x )  /\  ( F `  x )  e.  ran  F )  ->  E. y ( A  e.  y  /\  y  e.  ran  F ) )
2115, 20syl6 34 . . . 4  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( A  e.  ( F `  x )  ->  E. y ( A  e.  y  /\  y  e.  ran  F ) ) )
2221rexlimdva 2914 . . 3  |-  ( Fun 
F  ->  ( E. x  e.  dom  F  A  e.  ( F `  x
)  ->  E. y
( A  e.  y  /\  y  e.  ran  F ) ) )
2312, 22impbid 193 . 2  |-  ( Fun 
F  ->  ( E. y ( A  e.  y  /\  y  e. 
ran  F )  <->  E. x  e.  dom  F  A  e.  ( F `  x
) ) )
241, 23syl5bb 260 1  |-  ( Fun 
F  ->  ( A  e.  U. ran  F  <->  E. x  e.  dom  F  A  e.  ( F `  x
) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 187    /\ wa 370    = wceq 1437   E.wex 1657    e. wcel 1872   E.wrex 2772   U.cuni 4219   dom cdm 4853   ran crn 4854   Fun wfun 5595    Fn wfn 5596   ` cfv 5601
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-9 1876  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2057  ax-ext 2401  ax-sep 4546  ax-nul 4555  ax-pr 4660
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3an 984  df-tru 1440  df-ex 1658  df-nf 1662  df-sb 1791  df-eu 2273  df-mo 2274  df-clab 2408  df-cleq 2414  df-clel 2417  df-nfc 2568  df-ne 2616  df-ral 2776  df-rex 2777  df-rab 2780  df-v 3082  df-sbc 3300  df-dif 3439  df-un 3441  df-in 3443  df-ss 3450  df-nul 3762  df-if 3912  df-sn 3999  df-pr 4001  df-op 4005  df-uni 4220  df-br 4424  df-opab 4483  df-mpt 4484  df-id 4768  df-xp 4859  df-rel 4860  df-cnv 4861  df-co 4862  df-dm 4863  df-rn 4864  df-iota 5565  df-fun 5603  df-fn 5604  df-fv 5609
This theorem is referenced by:  fnunirn  6173  fin23lem30  8779  ustn0  21233  elrnust  21237  ustbas  21240  metuval  21562  elunirn2  28252  metidval  28701  pstmval  28706  elunirnmbfm  29083  fourierdlem70  37980  fourierdlem71  37981  fourierdlem80  37990
  Copyright terms: Public domain W3C validator