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

Theorem resfunexgALT 6122
Description: The restriction of a function to a set exists. Compare Proposition 6.17 of [TakeutiZaring] p. 28. This version has a shorter proof than resfunexg 5750 but requires ax-pow 4186 and ax-un 4445. (Contributed by NM, 7-Apr-1995.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
resfunexgALT  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A  |`  B )  e. 
_V )

Proof of Theorem resfunexgALT
StepHypRef Expression
1 dmresexg 4942 . . . 4  |-  ( B  e.  C  ->  dom  ( A  |`  B )  e.  _V )
21adantl 277 . . 3  |-  ( ( Fun  A  /\  B  e.  C )  ->  dom  ( A  |`  B )  e.  _V )
3 df-ima 4651 . . . 4  |-  ( A
" B )  =  ran  ( A  |`  B )
4 funimaexg 5312 . . . 4  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A " B )  e. 
_V )
53, 4eqeltrrid 2275 . . 3  |-  ( ( Fun  A  /\  B  e.  C )  ->  ran  ( A  |`  B )  e.  _V )
62, 5jca 306 . 2  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( dom  ( A  |`  B )  e.  _V  /\  ran  ( A  |`  B )  e.  _V ) )
7 xpexg 4752 . 2  |-  ( ( dom  ( A  |`  B )  e.  _V  /\ 
ran  ( A  |`  B )  e.  _V )  ->  ( dom  ( A  |`  B )  X. 
ran  ( A  |`  B ) )  e. 
_V )
8 relres 4947 . . . 4  |-  Rel  ( A  |`  B )
9 relssdmrn 5161 . . . 4  |-  ( Rel  ( A  |`  B )  ->  ( A  |`  B )  C_  ( dom  ( A  |`  B )  X.  ran  ( A  |`  B ) ) )
108, 9ax-mp 5 . . 3  |-  ( A  |`  B )  C_  ( dom  ( A  |`  B )  X.  ran  ( A  |`  B ) )
11 ssexg 4154 . . 3  |-  ( ( ( A  |`  B ) 
C_  ( dom  ( A  |`  B )  X. 
ran  ( A  |`  B ) )  /\  ( dom  ( A  |`  B )  X.  ran  ( A  |`  B ) )  e.  _V )  ->  ( A  |`  B )  e.  _V )
1210, 11mpan 424 . 2  |-  ( ( dom  ( A  |`  B )  X.  ran  ( A  |`  B ) )  e.  _V  ->  ( A  |`  B )  e.  _V )
136, 7, 123syl 17 1  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A  |`  B )  e. 
_V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2158   _Vcvv 2749    C_ wss 3141    X. cxp 4636   dom cdm 4638   ran crn 4639    |` cres 4640   "cima 4641   Rel wrel 4643   Fun wfun 5222
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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-v 2751  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-br 4016  df-opab 4077  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-fun 5230
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator