![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > indifcom | Structured version Visualization version GIF version |
Description: Commutation law for intersection and difference. (Contributed by Scott Fenton, 18-Feb-2013.) |
Ref | Expression |
---|---|
indifcom | ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = (𝐵 ∩ (𝐴 ∖ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | incom 4230 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
2 | 1 | difeq1i 4145 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∖ 𝐶) = ((𝐵 ∩ 𝐴) ∖ 𝐶) |
3 | indif2 4300 | . 2 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ 𝐵) ∖ 𝐶) | |
4 | indif2 4300 | . 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶) | |
5 | 2, 3, 4 | 3eqtr4i 2778 | 1 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = (𝐵 ∩ (𝐴 ∖ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∖ cdif 3973 ∩ cin 3975 |
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 |
This theorem is referenced by: ufprim 23938 cmmbl 25588 unmbl 25591 volinun 25600 limciun 25949 caragenuncllem 46433 |
Copyright terms: Public domain | W3C validator |