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

Theorem resdmdfsnOLD 6026
Description: Obsolete version of resdmdfsn 6025 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 6024 . 2 (Rel 𝑅 → (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (V ∖ {𝑋})))
2 indif1 4228 . . . 4 ((V ∖ {𝑋}) ∩ dom 𝑅) = ((V ∩ dom 𝑅) ∖ {𝑋})
3 incom 4155 . . . . . 6 (V ∩ dom 𝑅) = (dom 𝑅 ∩ V)
4 inv1 4348 . . . . . 6 (dom 𝑅 ∩ V) = dom 𝑅
53, 4eqtri 2783 . . . . 5 (V ∩ dom 𝑅) = dom 𝑅
65difeq1i 4070 . . . 4 ((V ∩ dom 𝑅) ∖ {𝑋}) = (dom 𝑅 ∖ {𝑋})
72, 6eqtri 2783 . . 3 ((V ∖ {𝑋}) ∩ dom 𝑅) = (dom 𝑅 ∖ {𝑋})
87reseq2i 5969 . 2 (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))
91, 8eqtr3di 2810 1 (Rel 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  Vcvv 3450  cdif 3896  cin 3898  {csn 4584  dom cdm 5655  cres 5657  Rel wrel 5660
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 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398
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 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-dm 5665  df-res 5667
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator