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

Theorem resfunexgALT 6016
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 5649 but requires ax-pow 4106 and ax-un 4363. (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 4850 . . . 4  |-  ( B  e.  C  ->  dom  ( A  |`  B )  e.  _V )
21adantl 275 . . 3  |-  ( ( Fun  A  /\  B  e.  C )  ->  dom  ( A  |`  B )  e.  _V )
3 df-ima 4560 . . . 4  |-  ( A
" B )  =  ran  ( A  |`  B )
4 funimaexg 5215 . . . 4  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( A " B )  e. 
_V )
53, 4eqeltrrid 2228 . . 3  |-  ( ( Fun  A  /\  B  e.  C )  ->  ran  ( A  |`  B )  e.  _V )
62, 5jca 304 . 2  |-  ( ( Fun  A  /\  B  e.  C )  ->  ( dom  ( A  |`  B )  e.  _V  /\  ran  ( A  |`  B )  e.  _V ) )
7 xpexg 4661 . 2  |-  ( ( dom  ( A  |`  B )  e.  _V  /\ 
ran  ( A  |`  B )  e.  _V )  ->  ( dom  ( A  |`  B )  X. 
ran  ( A  |`  B ) )  e. 
_V )
8 relres 4855 . . . 4  |-  Rel  ( A  |`  B )
9 relssdmrn 5067 . . . 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 4075 . . 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 421 . 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 103    e. wcel 1481   _Vcvv 2689    C_ wss 3076    X. cxp 4545   dom cdm 4547   ran crn 4548    |` cres 4549   "cima 4550   Rel wrel 4552   Fun wfun 5125
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-fun 5133
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator