Theorem resdifcom 5991

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 4228	. 2 ⊢ ((𝐴 ∖ 𝐶) ∩ (𝐵 × V)) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
2		df-res 5667	. 2 ⊢ ((𝐴 ∖ 𝐶) ↾ 𝐵) = ((𝐴 ∖ 𝐶) ∩ (𝐵 × V))
3		df-res 5667	. . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V))
4	3	difeq1i 4070	. 2 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
5	1, 2, 4	3eqtr4ri 2794	1 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∖ 𝐶) ↾ 𝐵)

This proof depends on syntax axioms:   = wceq 1570  Vcvv 3450   ∖ cdif 3896   ∩ cin 3898   × cxp 5653   ↾ cres 5657

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 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-in 3906  df-res 5667

This theorem is used by:  setsfun0  17267  cycpmrn  33586  tocyccntz  33587