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

Theorem indifcom 4229
Description: Commutation law for intersection and difference. (Contributed by Scott Fenton, 18-Feb-2013.)
Assertion
Ref Expression
indifcom (𝐴 ∩ (𝐵 ∖ 𝐶)) = (𝐵 ∩ (𝐴 ∖ 𝐶))

Proof of Theorem indifcom
StepHypRef Expression
1 incom 4155 . . 3 (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
21difeq1i 4070 . 2 ((𝐴 ∩ 𝐵) ∖ 𝐶) = ((𝐵 ∩ 𝐴) ∖ 𝐶)
3 indif2 4227 . 2 (𝐴 ∩ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ 𝐵) ∖ 𝐶)
4 indif2 4227 . 2 (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶)
52, 3, 43eqtr4i 2794 1 (𝐴 ∩ (𝐵 ∖ 𝐶)) = (𝐵 ∩ (𝐴 ∖ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 3896   ∩ cin 3898
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 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-in 3906
This theorem is used by:  ufprim  24228  cmmbl  25855  unmbl  25858  volinun  25867  limciun  26214  caragenuncllem  47521
  Copyright terms: Public domain W3C validator