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

Theorem resdmdfsn 5086
Description: Restricting a relation to its domain without a set is the same as restricting the relation to the universe without this set. (Contributed by AV, 2-Dec-2018.)
Assertion
Ref Expression
resdmdfsn  |-  ( Rel 
R  ->  ( R  |`  ( _V  \  { X } ) )  =  ( R  |`  ( dom  R  \  { X } ) ) )

Proof of Theorem resdmdfsn
StepHypRef Expression
1 resindm 5085 . 2  |-  ( Rel 
R  ->  ( R  |`  ( ( _V  \  { X } )  i^i 
dom  R ) )  =  ( R  |`  ( _V  \  { X } ) ) )
2 indif1 3470 . . . 4  |-  ( ( _V  \  { X } )  i^i  dom  R )  =  ( ( _V  i^i  dom  R
)  \  { X } )
3 incom 3415 . . . . . 6  |-  ( _V 
i^i  dom  R )  =  ( dom  R  i^i  _V )
4 inv1 3549 . . . . . 6  |-  ( dom 
R  i^i  _V )  =  dom  R
53, 4eqtri 2255 . . . . 5  |-  ( _V 
i^i  dom  R )  =  dom  R
65difeq1i 3337 . . . 4  |-  ( ( _V  i^i  dom  R
)  \  { X } )  =  ( dom  R  \  { X } )
72, 6eqtri 2255 . . 3  |-  ( ( _V  \  { X } )  i^i  dom  R )  =  ( dom 
R  \  { X } )
87reseq2i 5040 . 2  |-  ( R  |`  ( ( _V  \  { X } )  i^i 
dom  R ) )  =  ( R  |`  ( dom  R  \  { X } ) )
91, 8eqtr3di 2282 1  |-  ( Rel 
R  ->  ( R  |`  ( _V  \  { X } ) )  =  ( R  |`  ( dom  R  \  { X } ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398   _Vcvv 2815    \ cdif 3211    i^i cin 3213   {csn 3694   dom cdm 4754    |` cres 4756   Rel wrel 4759
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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-xp 4760  df-rel 4761  df-dm 4764  df-res 4766
This theorem is referenced by:  funresdfunsnss  5892  funresdfunsndc  6752
  Copyright terms: Public domain W3C validator