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

Theorem resindmOLD 6021
Description: Obsolete version of resindm 6020 as of 16-Jun-2026. (Contributed by FL, 6-Oct-2008.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
resindmOLD (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴𝐵))

Proof of Theorem resindmOLD
StepHypRef Expression
1 resdm 6016 . . 3 (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴)
21ineq2d 4175 . 2 (Rel 𝐴 → ((𝐴𝐵) ∩ (𝐴 ↾ dom 𝐴)) = ((𝐴𝐵) ∩ 𝐴))
3 resindi 5985 . 2 (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = ((𝐴𝐵) ∩ (𝐴 ↾ dom 𝐴))
4 incom 4164 . . 3 ((𝐴𝐵) ∩ 𝐴) = (𝐴 ∩ (𝐴𝐵))
5 inres 5987 . . 3 (𝐴 ∩ (𝐴𝐵)) = ((𝐴𝐴) ↾ 𝐵)
6 inidm 4181 . . . 4 (𝐴𝐴) = 𝐴
76reseq1i 5965 . . 3 ((𝐴𝐴) ↾ 𝐵) = (𝐴𝐵)
84, 5, 73eqtrri 2793 . 2 (𝐴𝐵) = ((𝐴𝐵) ∩ 𝐴)
92, 3, 83eqtr4g 2825 1 (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1563  cin 3906  dom cdm 5652  cres 5654  Rel wrel 5657
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-xp 5658  df-rel 5659  df-dm 5662  df-res 5664
This theorem is referenced by:  resdmdfsnOLD  6023
  Copyright terms: Public domain W3C validator