MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dmresexg Unicode version

Theorem dmresexg 5128
Description: The domain of a restriction to a set exists. (Contributed by NM, 7-Apr-1995.)
Assertion
Ref Expression
dmresexg  |-  ( B  e.  V  ->  dom  ( A  |`  B )  e.  _V )

Proof of Theorem dmresexg
StepHypRef Expression
1 dmres 5126 . 2  |-  dom  ( A  |`  B )  =  ( B  i^i  dom  A )
2 inex1g 4306 . 2  |-  ( B  e.  V  ->  ( B  i^i  dom  A )  e.  _V )
31, 2syl5eqel 2488 1  |-  ( B  e.  V  ->  dom  ( A  |`  B )  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1721   _Vcvv 2916    i^i cin 3279   dom cdm 4837    |` cres 4839
This theorem is referenced by:  resfunexg  5916  resfunexgALT  5917
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-sep 4290  ax-nul 4298  ax-pr 4363
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-sn 3780  df-pr 3781  df-op 3783  df-br 4173  df-opab 4227  df-xp 4843  df-dm 4847  df-res 4849
  Copyright terms: Public domain W3C validator