Theorem resindm 5990

Description: When restricting a relation, intersecting with the domain of the relation has no effect. (Contributed by FL, 6-Oct-2008.)

Assertion

Ref	Expression
resindm	⊢ (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴 ↾ 𝐵))

Proof of Theorem resindm

Step	Hyp	Ref	Expression
1		resdm 5986	. . 3 ⊢ (Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴)
2	1	ineq2d 4161	. 2 ⊢ (Rel 𝐴 → ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ 𝐴))
3		resindi 5955	. 2 ⊢ (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ dom 𝐴))
4		incom 4150	. . 3 ⊢ ((𝐴 ↾ 𝐵) ∩ 𝐴) = (𝐴 ∩ (𝐴 ↾ 𝐵))
5		inres 5957	. . 3 ⊢ (𝐴 ∩ (𝐴 ↾ 𝐵)) = ((𝐴 ∩ 𝐴) ↾ 𝐵)
6		inidm 4168	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
7	6	reseq1i 5935	. . 3 ⊢ ((𝐴 ∩ 𝐴) ↾ 𝐵) = (𝐴 ↾ 𝐵)
8	4, 5, 7	3eqtrri 2765	. 2 ⊢ (𝐴 ↾ 𝐵) = ((𝐴 ↾ 𝐵) ∩ 𝐴)
9	2, 3, 8	3eqtr4g 2797	1 ⊢ (Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴 ↾ 𝐵))

Syntax hints:   → wi 4   = wceq 1542   ∩ cin 3889  dom cdm 5625   ↾ cres 5627  Rel wrel 5630

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5232  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-xp 5631  df-rel 5632  df-dm 5635  df-res 5637

This theorem is referenced by:  resdmdfsn  5991  resfnfinfin  9241  resfifsupp  9304  poimirlem3  37961  fresin2  45623  limsupvaluz  46157  cncfuni  46335  fourierdlem48  46603  fourierdlem49  46604  fourierdlem113  46668  sssmf  47187