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

Theorem fnex 5876
Description: If the domain of a function is a set, the function is a set. Theorem 6.16(1) of [TakeutiZaring] p. 28. This theorem is derived using the Axiom of Replacement in the form of resfunexg 5875. (Contributed by NM, 14-Aug-1994.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
Assertion
Ref Expression
fnex  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  F  e.  _V )

Proof of Theorem fnex
StepHypRef Expression
1 fnrel 5428 . . 3  |-  ( F  Fn  A  ->  Rel  F )
21adantr 276 . 2  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  Rel  F )
3 df-fn 5329 . . 3  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
4 eleq1a 2303 . . . . . 6  |-  ( A  e.  B  ->  ( dom  F  =  A  ->  dom  F  e.  B ) )
54impcom 125 . . . . 5  |-  ( ( dom  F  =  A  /\  A  e.  B
)  ->  dom  F  e.  B )
6 resfunexg 5875 . . . . 5  |-  ( ( Fun  F  /\  dom  F  e.  B )  -> 
( F  |`  dom  F
)  e.  _V )
75, 6sylan2 286 . . . 4  |-  ( ( Fun  F  /\  ( dom  F  =  A  /\  A  e.  B )
)  ->  ( F  |` 
dom  F )  e. 
_V )
87anassrs 400 . . 3  |-  ( ( ( Fun  F  /\  dom  F  =  A )  /\  A  e.  B
)  ->  ( F  |` 
dom  F )  e. 
_V )
93, 8sylanb 284 . 2  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  ( F  |`  dom  F
)  e.  _V )
10 resdm 5052 . . . 4  |-  ( Rel 
F  ->  ( F  |` 
dom  F )  =  F )
1110eleq1d 2300 . . 3  |-  ( Rel 
F  ->  ( ( F  |`  dom  F )  e.  _V  <->  F  e.  _V ) )
1211biimpa 296 . 2  |-  ( ( Rel  F  /\  ( F  |`  dom  F )  e.  _V )  ->  F  e.  _V )
132, 9, 12syl2anc 411 1  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  F  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   _Vcvv 2802   dom cdm 4725    |` cres 4727   Rel wrel 4730   Fun wfun 5320    Fn wfn 5321
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334
This theorem is referenced by:  funex  5877  fex  5883  offval  6243  ofrfval  6244  uchoice  6300  tfrlemibex  6495  tfr1onlembex  6511  fndmeng  6985  cc2lem  7485  frecfzennn  10688  prdsbas2  13363  prdsplusgval  13367  prdsplusgfval  13368  prdsmulrval  13369  prdsmulrfval  13370  xpscf  13431  mulgval  13710  mulgfng  13712  invrfvald  14138
  Copyright terms: Public domain W3C validator