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

Theorem fnexALT 6272
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 5414. This version of fnex 5875 uses ax-pow 4264 and ax-un 4530, whereas fnex 5875 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 5428 . . . 4  |-  ( F  Fn  A  ->  Rel  F )
2 relssdmrn 5257 . . . 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 5429 . . . . 5  |-  ( F  Fn  A  ->  dom  F  =  A )
65eleq1d 2300 . . . 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 5427 . . . . 5  |-  ( F  Fn  A  ->  Fun  F )
9 funimaexg 5414 . . . . 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 5086 . . . . . . 7  |-  ( F
" dom  F )  =  ran  F
125imaeq2d 5076 . . . . . . 7  |-  ( F  Fn  A  ->  ( F " dom  F )  =  ( F " A ) )
1311, 12eqtr3id 2278 . . . . . 6  |-  ( F  Fn  A  ->  ran  F  =  ( F " A ) )
1413eleq1d 2300 . . . . 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 4840 . . 3  |-  ( ( dom  F  e.  B  /\  ran  F  e.  _V )  ->  ( dom  F  X.  ran  F )  e. 
_V )
187, 16, 17syl2anc 411 . 2  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  ( dom  F  X.  ran  F )  e.  _V )
19 ssexg 4228 . 2  |-  ( ( F  C_  ( dom  F  X.  ran  F )  /\  ( dom  F  X.  ran  F )  e. 
_V )  ->  F  e.  _V )
204, 18, 19syl2anc 411 1  |-  ( ( F  Fn  A  /\  A  e.  B )  ->  F  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2202   _Vcvv 2802    C_ wss 3200    X. cxp 4723   dom cdm 4725   ran crn 4726   "cima 4728   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-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
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-v 2804  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-br 4089  df-opab 4151  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-fun 5328  df-fn 5329
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator