Theorem resindmOLD 6030

Description: Obsolete version of resindm 6029 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 6025	. . 3 ⊢ (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴)
2	1	ineq2d 4173	. 2 ⊢ (Rel 𝐴 → ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ 𝐴))
3		resindi 5994	. 2 ⊢ (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴))
4		incom 4162	. . 3 ⊢ ((𝐴 ↾ 𝐵) ∩ 𝐴) = (𝐴 ∩ (𝐴 ↾ 𝐵))
5		inres 5996	. . 3 ⊢ (𝐴 ∩ (𝐴 ↾ 𝐵)) = ((𝐴 ∩ 𝐴) ↾ 𝐵)
6		inidm 4179	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
7	6	reseq1i 5974	. . 3 ⊢ ((𝐴 ∩ 𝐴) ↾ 𝐵) = (𝐴 ↾ 𝐵)
8	4, 5, 7	3eqtrri 2791	. 2 ⊢ (𝐴 ↾ 𝐵) = ((𝐴 ↾ 𝐵) ∩ 𝐴)
9	2, 3, 8	3eqtr4g 2823	1 ⊢ (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴 ↾ 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3904  dom cdm 5661   ↾ cres 5663  Rel wrel 5666

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-dm 5671  df-res 5673

This theorem is used by:  resdmdfsnOLD  6032