| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indif1 | Structured version Visualization version GIF version | ||
| Description: Bring an intersection in and out of a class difference. (Contributed by Mario Carneiro, 15-May-2015.) |
| Ref | Expression |
|---|---|
| indif1 | ⊢ ((𝐴 ∖ 𝐶) ∩ 𝐵) = ((𝐴 ∩ 𝐵) ∖ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indif2 4233 | . 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶) | |
| 2 | incom 4161 | . 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐴 ∖ 𝐶) ∩ 𝐵) | |
| 3 | incom 4161 | . . 3 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵) | |
| 4 | 3 | difeq1i 4076 | . 2 ⊢ ((𝐵 ∩ 𝐴) ∖ 𝐶) = ((𝐴 ∩ 𝐵) ∖ 𝐶) |
| 5 | 1, 2, 4 | 3eqtr3i 2793 | 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: resdifcom 5984 resdmdfsn 6018 resdmdfsnOLD 6019 hartogslem1 9490 fpwwe2 10601 leiso 14472 basdif0 23013 tgdif0 23052 kqdisj 23792 trufil 23970 difininv 32716 gtiso 32903 dfon4 36241 disjdifb 49431 |
| Copyright terms: Public domain | W3C validator |