ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  chfnrn Unicode version

Theorem chfnrn 5794
Description: The range of a choice function (a function that chooses an element from each member of its domain) is included in the union of its domain. (Contributed by NM, 31-Aug-1999.)
Assertion
Ref Expression
chfnrn  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  x )  ->  ran  F  C_  U. A )
Distinct variable groups:    x, A    x, F

Proof of Theorem chfnrn
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 fvelrnb 5729 . . . . 5  |-  ( F  Fn  A  ->  (
y  e.  ran  F  <->  E. x  e.  A  ( F `  x )  =  y ) )
21biimpd 144 . . . 4  |-  ( F  Fn  A  ->  (
y  e.  ran  F  ->  E. x  e.  A  ( F `  x )  =  y ) )
3 eleq1 2297 . . . . . . 7  |-  ( ( F `  x )  =  y  ->  (
( F `  x
)  e.  x  <->  y  e.  x ) )
43biimpcd 159 . . . . . 6  |-  ( ( F `  x )  e.  x  ->  (
( F `  x
)  =  y  -> 
y  e.  x ) )
54ralimi 2607 . . . . 5  |-  ( A. x  e.  A  ( F `  x )  e.  x  ->  A. x  e.  A  ( ( F `  x )  =  y  ->  y  e.  x ) )
6 rexim 2638 . . . . 5  |-  ( A. x  e.  A  (
( F `  x
)  =  y  -> 
y  e.  x )  ->  ( E. x  e.  A  ( F `  x )  =  y  ->  E. x  e.  A  y  e.  x )
)
75, 6syl 14 . . . 4  |-  ( A. x  e.  A  ( F `  x )  e.  x  ->  ( E. x  e.  A  ( F `  x )  =  y  ->  E. x  e.  A  y  e.  x ) )
82, 7sylan9 409 . . 3  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  x )  -> 
( y  e.  ran  F  ->  E. x  e.  A  y  e.  x )
)
9 eluni2 3923 . . 3  |-  ( y  e.  U. A  <->  E. x  e.  A  y  e.  x )
108, 9imbitrrdi 162 . 2  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  x )  -> 
( y  e.  ran  F  ->  y  e.  U. A ) )
1110ssrdv 3248 1  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  x )  ->  ran  F  C_  U. A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205   A.wral 2522   E.wrex 2523    C_ wss 3214   U.cuni 3919   ran crn 4755    Fn wfn 5352   ` cfv 5357
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-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator