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

Theorem fnexALT 6330
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 funimaexg 5460. This version of fnex 5928 uses ax-pow 4306 and ax-un 4573, whereas fnex 5928 does not. (Contributed by NM, 14-Aug-1994.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
fnexALT  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  F  e.  _V )

Proof of Theorem fnexALT
StepHypRef Expression
1 fnrel 5474 . . . 4  |-  ( F  Fn  A  ->  Rel  F )
2 relssdmrn 5303 . . . 4  |-  ( Rel 
F  ->  F  C_  ( dom  F  X.  ran  F
) )
31, 2syl 14 . . 3  |-  ( F  Fn  A  ->  F  C_  ( dom  F  X.  ran  F ) )
43adantr 276 . 2  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  F  C_  ( dom  F  X.  ran  F ) )
5 fndm 5475 . . . . 5  |-  ( F  Fn  A  ->  dom  F  =  A )
65eleq1d 2307 . . . 4  |-  ( F  Fn  A  ->  ( dom  F  e.  B  <->  A  e.  B ) )
76biimpar 297 . . 3  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  dom  F  e.  B
)
8 fnfun 5473 . . . . 5  |-  ( F  Fn  A  ->  Fun  F )
9 funimaexg 5460 . . . . 5  |-  ( ( Fun  F  /\  A  e.  B )  ->  ( F " A )  e. 
_V )
108, 9sylan 283 . . . 4  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  ( F " A
)  e.  _V )
11 imadmrn 5131 . . . . . . 7  |-  ( F
" dom  F )  =  ran  F
125imaeq2d 5121 . . . . . . 7  |-  ( F  Fn  A  ->  ( F " dom  F )  =  ( F " A ) )
1311, 12eqtr3id 2285 . . . . . 6  |-  ( F  Fn  A  ->  ran  F  =  ( F " A ) )
1413eleq1d 2307 . . . . 5  |-  ( F  Fn  A  ->  ( ran  F  e.  _V  <->  ( F " A )  e.  _V ) )
1514biimpar 297 . . . 4  |-  ( ( F  Fn  A  /\  ( F " A )  e.  _V )  ->  ran  F  e.  _V )
1610, 15syldan 282 . . 3  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  ran  F  e.  _V )
17 xpexg 4884 . . 3  |-  ( ( dom  F  e.  B  /\  ran  F  e.  _V )  ->  ( dom  F  X.  ran  F )  e. 
_V )
187, 16, 17syl2anc 415 . 2  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  ( dom  F  X.  ran  F )  e.  _V )
19 ssexg 4267 . 2  |-  ( ( F  C_  ( dom  F  X.  ran  F )  /\  ( dom  F  X.  ran  F )  e. 
_V )  ->  F  e.  _V )
204, 18, 19syl2anc 415 1  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  F  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2209   _Vcvv 2821    C_ wss 3220    X. cxp 4767   dom cdm 4769   ran crn 4770   "cima 4772   Rel wrel 4774   Fun wfun 5366    Fn wfn 5367
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-fun 5374  df-fn 5375
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator