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

Theorem resindmOLD 6015
Description: Obsolete version of resindm 6014 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 6010 . . 3 (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴)
21ineq2d 4172 . 2 (Rel 𝐴 → ((𝐴𝐵) ∩ (𝐴 ↾ dom 𝐴)) = ((𝐴𝐵) ∩ 𝐴))
3 resindi 5979 . 2 (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = ((𝐴𝐵) ∩ (𝐴 ↾ dom 𝐴))
4 incom 4161 . . 3 ((𝐴𝐵) ∩ 𝐴) = (𝐴 ∩ (𝐴𝐵))
5 inres 5981 . . 3 (𝐴 ∩ (𝐴𝐵)) = ((𝐴𝐴) ↾ 𝐵)
6 inidm 4178 . . . 4 (𝐴𝐴) = 𝐴
76reseq1i 5959 . . 3 ((𝐴𝐴) ↾ 𝐵) = (𝐴𝐵)
84, 5, 73eqtrri 2789 . 2 (𝐴𝐵) = ((𝐴𝐵) ∩ 𝐴)
92, 3, 83eqtr4g 2821 1 (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1559  cin 3903  dom cdm 5645  cres 5647  Rel wrel 5650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5245  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-xp 5651  df-rel 5652  df-dm 5655  df-res 5657
This theorem is referenced by:  resdmdfsnOLD  6017
  Copyright terms: Public domain W3C validator