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

Theorem resdmdfsnOLD 6037
Description: Obsolete version of resdmdfsn 6036 as of 16-Jun-2026. (Contributed by AV, 2-Dec-2018.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
resdmdfsnOLD (Rel 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋})))

Proof of Theorem resdmdfsnOLD
StepHypRef Expression
1 resindmOLD 6035 . 2 (Rel 𝑅 → (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (V ∖ {𝑋})))
2 indif1 4238 . . . 4 ((V ∖ {𝑋}) ∩ dom 𝑅) = ((V ∩ dom 𝑅) ∖ {𝑋})
3 incom 4165 . . . . . 6 (V ∩ dom 𝑅) = (dom 𝑅 ∩ V)
4 inv1 4358 . . . . . 6 (dom 𝑅 ∩ V) = dom 𝑅
53, 4eqtri 2789 . . . . 5 (V ∩ dom 𝑅) = dom 𝑅
65difeq1i 4080 . . . 4 ((V ∩ dom 𝑅) ∖ {𝑋}) = (dom 𝑅 ∖ {𝑋})
72, 6eqtri 2789 . . 3 ((V ∖ {𝑋}) ∩ dom 𝑅) = (dom 𝑅 ∖ {𝑋})
87reseq2i 5980 . 2 (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))
91, 8eqtr3di 2816 1 (Rel 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  Vcvv 3458  cdif 3905  cin 3907  {csn 4594  dom cdm 5666  cres 5668  Rel wrel 5671
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-dm 5676  df-res 5678
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator