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

Theorem chfnrn 5278
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 5221 . . . . 5  |-  ( F  Fn  A  ->  (
y  e.  ran  F  <->  E. x  e.  A  ( F `  x )  =  y ) )
21biimpd 132 . . . 4  |-  ( F  Fn  A  ->  (
y  e.  ran  F  ->  E. x  e.  A  ( F `  x )  =  y ) )
3 eleq1 2100 . . . . . . 7  |-  ( ( F `  x )  =  y  ->  (
( F `  x
)  e.  x  <->  y  e.  x ) )
43biimpcd 148 . . . . . 6  |-  ( ( F `  x )  e.  x  ->  (
( F `  x
)  =  y  -> 
y  e.  x ) )
54ralimi 2384 . . . . 5  |-  ( A. x  e.  A  ( F `  x )  e.  x  ->  A. x  e.  A  ( ( F `  x )  =  y  ->  y  e.  x ) )
6 rexim 2413 . . . . 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 389 . . 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 3584 . . 3  |-  ( y  e.  U. A  <->  E. x  e.  A  y  e.  x )
108, 9syl6ibr 151 . 2  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  x )  -> 
( y  e.  ran  F  ->  y  e.  U. A ) )
1110ssrdv 2951 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 97    = wceq 1243    e. wcel 1393   A.wral 2306   E.wrex 2307    C_ wss 2917   U.cuni 3580   ran crn 4346    Fn wfn 4897   ` cfv 4902
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-iota 4867  df-fun 4904  df-fn 4905  df-fv 4910
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator