| 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 4162 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
| 2 | 1 | difeq1i 4077 | . 2 ⊢ ((𝐴 ∩ 𝐵) ∖ 𝐶) = ((𝐵 ∩ 𝐴) ∖ 𝐶) |
| 3 | indif2 4234 | . 2 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ 𝐵) ∖ 𝐶) | |
| 4 | indif2 4234 | . 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶) | |
| 5 | 2, 3, 4 | 3eqtr4i 2798 | 1 ⊢ (𝐴 ∩ (𝐵 ∖ 𝐶)) = (𝐵 ∩ (𝐴 ∖ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∖ cdif 3903 ∩ cin 3905 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-in 3913 |
| This theorem is used by: ufprim 24119 cmmbl 25746 unmbl 25749 volinun 25758 limciun 26106 caragenuncllem 47286 |
| Copyright terms: Public domain | W3C validator |