| 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 4209 | . 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐵 ∩ 𝐴) ∖ 𝐶) | |
| 2 | incom 4138 | . 2 ⊢ (𝐵 ∩ (𝐴 ∖ 𝐶)) = ((𝐴 ∖ 𝐶) ∩ 𝐵) | |
| 3 | incom 4138 | . . 3 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵) | |
| 4 | 3 | difeq1i 4053 | . 2 ⊢ ((𝐵 ∩ 𝐴) ∖ 𝐶) = ((𝐴 ∩ 𝐵) ∖ 𝐶) |
| 5 | 1, 2, 4 | 3eqtr3i 2770 | 1 ⊢ ((𝐴 ∖ 𝐶) ∩ 𝐵) = ((𝐴 ∩ 𝐵) ∖ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∖ cdif 3880 ∩ cin 3882 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-dif 3886 df-in 3890 |
| This theorem is referenced by: resdifcom 5950 resdmdfsn 5983 hartogslem1 9447 fpwwe2 10557 leiso 14412 basdif0 22936 tgdif0 22975 kqdisj 23715 trufil 23893 difininv 32605 gtiso 32793 dfon4 36119 disjdifb 49300 |
| Copyright terms: Public domain | W3C validator |