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

Theorem resfunexgALT 6327
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 5927 but requires ax-pow 4306 and ax-un 4573. (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 5081 . . . 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 4782 . . . 4  |-  ( A
" B )  =  ran  ( A  |`  B )
4 funimaexg 5460 . . . 4  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A " B )  e. 
_V )
53, 4eqeltrrid 2326 . . 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 4884 . 2  |-  ( ( dom  ( A  |`  B )  e.  _V  /\ 
ran  ( A  |`  B )  e.  _V )  ->  ( dom  ( A  |`  B )  X. 
ran  ( A  |`  B ) )  e. 
_V )
8 relres 5086 . . . 4  |-  Rel  ( A  |`  B )
9 relssdmrn 5303 . . . 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 4267 . . 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 428 . 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 2209   _Vcvv 2821    C_ wss 3220    X. cxp 4767   dom cdm 4769   ran crn 4770    |` cres 4771   "cima 4772   Rel wrel 4774   Fun wfun 5366
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
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator