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

Step	Hyp	Ref	Expression
1		resdm 6016	. . 3 ⊢ (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴)
2	1	ineq2d 4116	. 2 ⊢ (Rel 𝐴 → ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ 𝐴))
3		resindi 5986	. 2 ⊢ (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴))
4		incom 4105	. . 3 ⊢ ((𝐴 ↾ 𝐵) ∩ 𝐴) = (𝐴 ∩ (𝐴 ↾ 𝐵))
5		inres 5988	. . 3 ⊢ (𝐴 ∩ (𝐴 ↾ 𝐵)) = ((𝐴 ∩ 𝐴) ↾ 𝐵)
6		inidm 4122	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
7	6	reseq1i 5966	. . 3 ⊢ ((𝐴 ∩ 𝐴) ↾ 𝐵) = (𝐴 ↾ 𝐵)
8	4, 5, 7	3eqtrri 2788	. 2 ⊢ (𝐴 ↾ 𝐵) = ((𝐴 ↾ 𝐵) ∩ 𝐴)
9	2, 3, 8	3eqtr4g 2820	1 ⊢ (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴 ↾ 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∩ cin 4088  dom cdm 5650   ↾ cres 5652  Rel wrel 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-dm 5660  df-res 5662

This theorem is used by:  resdmdfsnOLD  6023