Theorem resindmOLD 6035

Description: Obsolete version of resindm 6034 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

Step	Hyp	Ref	Expression
1		resdm 6030	. . 3 ⊢ (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴)
2	1	ineq2d 4176	. 2 ⊢ (Rel 𝐴 → ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ 𝐴))
3		resindi 5999	. 2 ⊢ (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴))
4		incom 4165	. . 3 ⊢ ((𝐴 ↾ 𝐵) ∩ 𝐴) = (𝐴 ∩ (𝐴 ↾ 𝐵))
5		inres 6001	. . 3 ⊢ (𝐴 ∩ (𝐴 ↾ 𝐵)) = ((𝐴 ∩ 𝐴) ↾ 𝐵)
6		inidm 4182	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
7	6	reseq1i 5979	. . 3 ⊢ ((𝐴 ∩ 𝐴) ↾ 𝐵) = (𝐴 ↾ 𝐵)
8	4, 5, 7	3eqtrri 2794	. 2 ⊢ (𝐴 ↾ 𝐵) = ((𝐴 ↾ 𝐵) ∩ 𝐴)
9	2, 3, 8	3eqtr4g 2826	1 ⊢ (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴 ↾ 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3907  dom cdm 5666   ↾ cres 5668  Rel wrel 5671

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-dm 5676  df-res 5678

This theorem is used by:  resdmdfsnOLD  6037