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

Theorem resdmdfsn 5056
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 5055 . 2  |-  ( Rel 
R  ->  ( R  |`  ( ( _V  \  { X } )  i^i 
dom  R ) )  =  ( R  |`  ( _V  \  { X } ) ) )
2 indif1 3452 . . . 4  |-  ( ( _V  \  { X } )  i^i  dom  R )  =  ( ( _V  i^i  dom  R
)  \  { X } )
3 incom 3399 . . . . . 6  |-  ( _V 
i^i  dom  R )  =  ( dom  R  i^i  _V )
4 inv1 3531 . . . . . 6  |-  ( dom 
R  i^i  _V )  =  dom  R
53, 4eqtri 2252 . . . . 5  |-  ( _V 
i^i  dom  R )  =  dom  R
65difeq1i 3321 . . . 4  |-  ( ( _V  i^i  dom  R
)  \  { X } )  =  ( dom  R  \  { X } )
72, 6eqtri 2252 . . 3  |-  ( ( _V  \  { X } )  i^i  dom  R )  =  ( dom 
R  \  { X } )
87reseq2i 5010 . 2  |-  ( R  |`  ( ( _V  \  { X } )  i^i 
dom  R ) )  =  ( R  |`  ( dom  R  \  { X } ) )
91, 8eqtr3di 2279 1  |-  ( Rel 
R  ->  ( R  |`  ( _V  \  { X } ) )  =  ( R  |`  ( dom  R  \  { X } ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397   _Vcvv 2802    \ cdif 3197    i^i cin 3199   {csn 3669   dom cdm 4725    |` cres 4727   Rel wrel 4730
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-dm 4735  df-res 4737
This theorem is referenced by:  funresdfunsnss  5857  funresdfunsndc  6674
  Copyright terms: Public domain W3C validator