| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > difundi | Structured version Visualization version GIF version | ||
| Description: Distributive law for class difference. Theorem 39 of [Suppes] p. 29. (Contributed by NM, 17-Aug-2004.) |
| Ref | Expression |
|---|---|
| difundi | ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∩ (𝐴 ∖ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfun3 4230 | . . 3 ⊢ (𝐵 ∪ 𝐶) = (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) | |
| 2 | 1 | difeq2i 4077 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) |
| 3 | inindi 4189 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶))) | |
| 4 | dfin2 4225 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) | |
| 5 | invdif 4233 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 6 | invdif 4233 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐶)) = (𝐴 ∖ 𝐶) | |
| 7 | 5, 6 | ineq12i 4172 | . . 3 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴 ∖ 𝐵) ∩ (𝐴 ∖ 𝐶)) |
| 8 | 3, 4, 7 | 3eqtr3i 2768 | . 2 ⊢ (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) = ((𝐴 ∖ 𝐵) ∩ (𝐴 ∖ 𝐶)) |
| 9 | 2, 8 | eqtri 2760 | 1 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∩ (𝐴 ∖ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 Vcvv 3442 ∖ cdif 3900 ∪ cun 3901 ∩ cin 3902 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 |
| This theorem is referenced by: undm 4251 uncld 22997 inmbl 25511 difuncomp 32640 clsun 36544 poimirlem8 37879 ntrclskb 44425 ntrclsk3 44426 ntrclsk13 44427 |
| Copyright terms: Public domain | W3C validator |