| 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 4161 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
| 2 | 1 | difeq1i 4076 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∖ 𝐶) = ((𝐵 ∩ 𝐴) ∖ 𝐶) |
| 3 | indif2 4233 | . 2 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ 𝐵) ∖ 𝐶) | |
| 4 | indif2 4233 | . 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶) | |
| 5 | 2, 3, 4 | 3eqtr4i 2795 | 1 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = (𝐵 ∩ (𝐴 ∖ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1560 ∖ cdif 3901 ∩ cin 3903 |
| 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 |
| This theorem is referenced by: ufprim 23969 cmmbl 25596 unmbl 25599 volinun 25608 limciun 25956 caragenuncllem 47086 |
| Copyright terms: Public domain | W3C validator |