Theorem resdifdi 6239

Description: Distributive law for restriction over difference. (Contributed by BTernaryTau, 15-Aug-2024.)

Assertion

Ref	Expression
resdifdi	⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶))

Proof of Theorem resdifdi

Step	Hyp	Ref	Expression
1		df-res 5675	. . 3 ⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = (𝐴 ∩ ((𝐵 ∖ 𝐶) × V))
2		difxp1 6164	. . . 4 ⊢ ((𝐵 ∖ 𝐶) × V) = ((𝐵 × V) ∖ (𝐶 × V))
3	2	ineq2i 4170	. . 3 ⊢ (𝐴 ∩ ((𝐵 ∖ 𝐶) × V)) = (𝐴 ∩ ((𝐵 × V) ∖ (𝐶 × V)))
4		indifdi 4247	. . 3 ⊢ (𝐴 ∩ ((𝐵 × V) ∖ (𝐶 × V))) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V)))
5	1, 3, 4	3eqtri 2792	. 2 ⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V)))
6		df-res 5675	. . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V))
7		df-res 5675	. . 3 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V))
8	6, 7	difeq12i 4079	. 2 ⊢ ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V)))
9	5, 8	eqtr4i 2791	1 ⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶))

This proof depends on syntax axioms:   = wceq 1570  Vcvv 3457   ∖ cdif 3903   ∩ cin 3905   × cxp 5661   ↾ cres 5665

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 2737  ax-sep 5259  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-opab 5176  df-xp 5669  df-rel 5670  df-res 5675

This theorem is used by: (None)