MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  resdmdfsn Structured version   Visualization version   GIF version

Theorem resdmdfsn 5977
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 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋})))

Proof of Theorem resdmdfsn
StepHypRef Expression
1 resindm 5976 . 2 (Rel 𝑅 → (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (V ∖ {𝑋})))
2 indif1 4222 . . . 4 ((V ∖ {𝑋}) ∩ dom 𝑅) = ((V ∩ dom 𝑅) ∖ {𝑋})
3 incom 4152 . . . . . 6 (V ∩ dom 𝑅) = (dom 𝑅 ∩ V)
4 inv1 4345 . . . . . 6 (dom 𝑅 ∩ V) = dom 𝑅
53, 4eqtri 2765 . . . . 5 (V ∩ dom 𝑅) = dom 𝑅
65difeq1i 4069 . . . 4 ((V ∩ dom 𝑅) ∖ {𝑋}) = (dom 𝑅 ∖ {𝑋})
72, 6eqtri 2765 . . 3 ((V ∖ {𝑋}) ∩ dom 𝑅) = (dom 𝑅 ∖ {𝑋})
87reseq2i 5924 . 2 (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))
91, 8eqtr3di 2792 1 (Rel 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  Vcvv 3442  cdif 3898  cin 3900  {csn 4577  dom cdm 5624  cres 5626  Rel wrel 5629
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2708  ax-sep 5247  ax-nul 5254  ax-pr 5376
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2715  df-cleq 2729  df-clel 2815  df-ral 3063  df-rex 3072  df-rab 3405  df-v 3444  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4274  df-if 4478  df-sn 4578  df-pr 4580  df-op 4584  df-br 5097  df-opab 5159  df-xp 5630  df-rel 5631  df-dm 5634  df-res 5636
This theorem is referenced by:  funresdfunsn  7121
  Copyright terms: Public domain W3C validator