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

Theorem resdmdfsn 5054
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 5053 . 2  |-  ( Rel 
R  ->  ( R  |`  ( ( _V  \  { X } )  i^i 
dom  R ) )  =  ( R  |`  ( _V  \  { X } ) ) )
2 indif1 3450 . . . 4  |-  ( ( _V  \  { X } )  i^i  dom  R )  =  ( ( _V  i^i  dom  R
)  \  { X } )
3 incom 3397 . . . . . 6  |-  ( _V 
i^i  dom  R )  =  ( dom  R  i^i  _V )
4 inv1 3529 . . . . . 6  |-  ( dom 
R  i^i  _V )  =  dom  R
53, 4eqtri 2250 . . . . 5  |-  ( _V 
i^i  dom  R )  =  dom  R
65difeq1i 3319 . . . 4  |-  ( ( _V  i^i  dom  R
)  \  { X } )  =  ( dom  R  \  { X } )
72, 6eqtri 2250 . . 3  |-  ( ( _V  \  { X } )  i^i  dom  R )  =  ( dom 
R  \  { X } )
87reseq2i 5008 . 2  |-  ( R  |`  ( ( _V  \  { X } )  i^i 
dom  R ) )  =  ( R  |`  ( dom  R  \  { X } ) )
91, 8eqtr3di 2277 1  |-  ( Rel 
R  ->  ( R  |`  ( _V  \  { X } ) )  =  ( R  |`  ( dom  R  \  { X } ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395   _Vcvv 2800    \ cdif 3195    i^i cin 3197   {csn 3667   dom cdm 4723    |` cres 4725   Rel wrel 4728
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-opab 4149  df-xp 4729  df-rel 4730  df-dm 4733  df-res 4735
This theorem is referenced by:  funresdfunsnss  5852  funresdfunsndc  6669
  Copyright terms: Public domain W3C validator