Theorem resdifcom 5969

Description: Commutative law for restriction and difference. (Contributed by AV, 7-Jun-2021.)

Assertion

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

Proof of Theorem resdifcom

Step	Hyp	Ref	Expression
1		indif1 4245	. 2 ⊢ ((𝐴 ∖ 𝐶) ∩ (𝐵 × V)) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
2		df-res 5650	. 2 ⊢ ((𝐴 ∖ 𝐶) ↾ 𝐵) = ((𝐴 ∖ 𝐶) ∩ (𝐵 × V))
3		df-res 5650	. . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V))
4	3	difeq1i 4085	. 2 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
5	1, 2, 4	3eqtr4ri 2763	1 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∖ 𝐶) ↾ 𝐵)

Syntax hints:   = wceq 1540  Vcvv 3447   ∖ cdif 3911   ∩ cin 3913   × cxp 5636   ↾ cres 5640

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3406  df-v 3449  df-dif 3917  df-in 3921  df-res 5650

This theorem is referenced by:  setsfun0  17142  cycpmrn  33100  tocyccntz  33101