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

Theorem resdifcom 5984
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 4234 . 2 ((𝐴𝐶) ∩ (𝐵 × V)) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
2 df-res 5659 . 2 ((𝐴𝐶) ↾ 𝐵) = ((𝐴𝐶) ∩ (𝐵 × V))
3 df-res 5659 . . 3 (𝐴𝐵) = (𝐴 ∩ (𝐵 × V))
43difeq1i 4076 . 2 ((𝐴𝐵) ∖ 𝐶) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶)
51, 2, 43eqtr4ri 2796 1 ((𝐴𝐵) ∖ 𝐶) = ((𝐴𝐶) ↾ 𝐵)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1560  Vcvv 3454  cdif 3901  cin 3903   × cxp 5645  cres 5649
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1563  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3456  df-dif 3907  df-in 3911  df-res 5659
This theorem is referenced by:  setsfun0  17208  cycpmrn  33323  tocyccntz  33324
  Copyright terms: Public domain W3C validator