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

Theorem ffnfv 5344
Description: A function maps to a class to which all values belong. (Contributed by NM, 3-Dec-2003.)
Assertion
Ref Expression
ffnfv  |-  ( F : A --> B  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B
) )
Distinct variable groups:    x, A    x, B    x, F

Proof of Theorem ffnfv
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ffn 5066 . . 3  |-  ( F : A --> B  ->  F  Fn  A )
2 ffvelrn 5321 . . . 4  |-  ( ( F : A --> B  /\  x  e.  A )  ->  ( F `  x
)  e.  B )
32ralrimiva 2434 . . 3  |-  ( F : A --> B  ->  A. x  e.  A  ( F `  x )  e.  B )
41, 3jca 300 . 2  |-  ( F : A --> B  -> 
( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) )
5 simpl 107 . . 3  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  ->  F  Fn  A )
6 fvelrnb 5242 . . . . . 6  |-  ( F  Fn  A  ->  (
y  e.  ran  F  <->  E. x  e.  A  ( F `  x )  =  y ) )
76biimpd 142 . . . . 5  |-  ( F  Fn  A  ->  (
y  e.  ran  F  ->  E. x  e.  A  ( F `  x )  =  y ) )
8 nfra1 2397 . . . . . 6  |-  F/ x A. x  e.  A  ( F `  x )  e.  B
9 nfv 1461 . . . . . 6  |-  F/ x  y  e.  B
10 rsp 2411 . . . . . . 7  |-  ( A. x  e.  A  ( F `  x )  e.  B  ->  ( x  e.  A  ->  ( F `  x )  e.  B ) )
11 eleq1 2141 . . . . . . . 8  |-  ( ( F `  x )  =  y  ->  (
( F `  x
)  e.  B  <->  y  e.  B ) )
1211biimpcd 157 . . . . . . 7  |-  ( ( F `  x )  e.  B  ->  (
( F `  x
)  =  y  -> 
y  e.  B ) )
1310, 12syl6 33 . . . . . 6  |-  ( A. x  e.  A  ( F `  x )  e.  B  ->  ( x  e.  A  ->  (
( F `  x
)  =  y  -> 
y  e.  B ) ) )
148, 9, 13rexlimd 2474 . . . . 5  |-  ( A. x  e.  A  ( F `  x )  e.  B  ->  ( E. x  e.  A  ( F `  x )  =  y  ->  y  e.  B ) )
157, 14sylan9 401 . . . 4  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  -> 
( y  e.  ran  F  ->  y  e.  B
) )
1615ssrdv 3005 . . 3  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  ->  ran  F  C_  B )
17 df-f 4926 . . 3  |-  ( F : A --> B  <->  ( F  Fn  A  /\  ran  F  C_  B ) )
185, 16, 17sylanbrc 408 . 2  |-  ( ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  ->  F : A --> B )
194, 18impbii 124 1  |-  ( F : A --> B  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284    e. wcel 1433   A.wral 2348   E.wrex 2349    C_ wss 2973   ran crn 4364    Fn wfn 4917   -->wf 4918   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-fv 4930
This theorem is referenced by:  ffnfvf  5345  fnfvrnss  5346  fmpt2d  5348  ffnov  5625  cnref1o  8733  iseqf  9444  shftf  9718
  Copyright terms: Public domain W3C validator