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

Theorem resdifcom 6030
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 4301 . 2 ((𝐴𝐶) ∩ (𝐵 × V)) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
2 df-res 5712 . 2 ((𝐴𝐶) ↾ 𝐵) = ((𝐴𝐶) ∩ (𝐵 × V))
3 df-res 5712 . . 3 (𝐴𝐵) = (𝐴 ∩ (𝐵 × V))
43difeq1i 4145 . 2 ((𝐴𝐵) ∖ 𝐶) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
51, 2, 43eqtr4ri 2779 1 ((𝐴𝐵) ∖ 𝐶) = ((𝐴𝐶) ↾ 𝐵)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1537  Vcvv 3488  cdif 3973  cin 3975   × cxp 5698  cres 5702
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-in 3983  df-res 5712
This theorem is referenced by:  setsfun0  17221  cycpmrn  33138  tocyccntz  33139
  Copyright terms: Public domain W3C validator