MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  resdifcom Structured version   Visualization version   GIF version

Theorem resdifcom 6005
Description: Commutative law for restriction and difference. (Contributed by AV, 7-Jun-2021.)
Assertion
Ref Expression
resdifcom ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∖ 𝐶) ↾ 𝐵)

Proof of Theorem resdifcom
StepHypRef Expression
1 indif1 4230 . 2 ((𝐴 ∖ 𝐶) ∩ (𝐵 × V)) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
2 df-res 5670 . 2 ((𝐴 ∖ 𝐶) ↾ 𝐵) = ((𝐴 ∖ 𝐶) ∩ (𝐵 × V))
3 df-res 5670 . . 3 (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V))
43difeq1i 4062 . 2 ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
51, 2, 43eqtr4ri 2797 1 ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∖ 𝐶) ↾ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3454   ∖ cdif 4048   ∩ cin 4092   × cxp 5656   ↾ cres 5660
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-dif 4050  df-in 4094  df-res 5670
This theorem is used by:  setsfun0  17394  cycpmrn  33803  tocyccntz  33804
  Copyright terms: Public domain W3C validator