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

Theorem resfunexgALT 6192
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 5804 but requires ax-pow 4217 and ax-un 4479. (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 4981 . . . 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 4687 . . . 4  |-  ( A
" B )  =  ran  ( A  |`  B )
4 funimaexg 5357 . . . 4  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A " B )  e. 
_V )
53, 4eqeltrrid 2292 . . 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 4788 . 2  |-  ( ( dom  ( A  |`  B )  e.  _V  /\ 
ran  ( A  |`  B )  e.  _V )  ->  ( dom  ( A  |`  B )  X. 
ran  ( A  |`  B ) )  e. 
_V )
8 relres 4986 . . . 4  |-  Rel  ( A  |`  B )
9 relssdmrn 5202 . . . 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 4182 . . 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 2175   _Vcvv 2771    C_ wss 3165    X. cxp 4672   dom cdm 4674   ran crn 4675    |` cres 4676   "cima 4677   Rel wrel 4679   Fun wfun 5264
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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-fun 5272
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator