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

Theorem resresdm 6187
Description: A restriction by an arbitrary set is a restriction by its domain. (Contributed by AV, 16-Nov-2020.)
Assertion
Ref Expression
resresdm (𝐹 = (𝐸𝐴) → 𝐹 = (𝐸 ↾ dom 𝐹))

Proof of Theorem resresdm
StepHypRef Expression
1 id 22 . 2 (𝐹 = (𝐸𝐴) → 𝐹 = (𝐸𝐴))
2 dmeq 5851 . . . 4 (𝐹 = (𝐸𝐴) → dom 𝐹 = dom (𝐸𝐴))
32reseq2d 5937 . . 3 (𝐹 = (𝐸𝐴) → (𝐸 ↾ dom 𝐹) = (𝐸 ↾ dom (𝐸𝐴)))
4 resdmres 6186 . . 3 (𝐸 ↾ dom (𝐸𝐴)) = (𝐸𝐴)
53, 4eqtr2di 2793 . 2 (𝐹 = (𝐸𝐴) → (𝐸𝐴) = (𝐸 ↾ dom 𝐹))
61, 5eqtrd 2776 1 (𝐹 = (𝐸𝐴) → 𝐹 = (𝐸 ↾ dom 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1548  dom cdm 5620  cres 5622
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5220  ax-pr 5364
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-br 5075  df-opab 5137  df-xp 5626  df-rel 5627  df-cnv 5628  df-dm 5630  df-rn 5631  df-res 5632
This theorem is referenced by:  uhgrspan1  29392
  Copyright terms: Public domain W3C validator