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

Theorem resdmdfsn 6031
Description: Restricting a class to its domain without a set is the same as restricting the class to the universe without this set. (Contributed by AV, 2-Dec-2018.) Remove antecedent. (Revised by Eric Schmidt, 16-Jun-2026.)
Assertion
Ref Expression
resdmdfsn (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))

Proof of Theorem resdmdfsn
StepHypRef Expression
1 resindm 6029 . 2 (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (V ∖ {𝑋}))
2 indif1 4235 . . . 4 ((V ∖ {𝑋}) ∩ dom 𝑅) = ((V ∩ dom 𝑅) ∖ {𝑋})
3 inv1 4355 . . . . . 6 (dom 𝑅 ∩ V) = dom 𝑅
43ineqcomi 4164 . . . . 5 (V ∩ dom 𝑅) = dom 𝑅
54difeq1i 4077 . . . 4 ((V ∩ dom 𝑅) ∖ {𝑋}) = (dom 𝑅 ∖ {𝑋})
62, 5eqtri 2786 . . 3 ((V ∖ {𝑋}) ∩ dom 𝑅) = (dom 𝑅 ∖ {𝑋})
76reseq2i 5975 . 2 (𝑅 ↾ ((V ∖ {𝑋}) ∩ dom 𝑅)) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))
81, 7eqtr3i 2788 1 (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋}))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1570  Vcvv 3455  cdif 3902  cin 3904  {csn 4589  dom cdm 5661  cres 5663
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-dm 5671  df-res 5673
This theorem is referenced by:  funresdfunsn  7187  fresunsn  32970
  Copyright terms: Public domain W3C validator