| 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 4229 | . . 3 ⊢ (𝐵 ∪ 𝐶) = (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) | |
| 2 | 1 | difeq2i 4078 | . 2 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) |
| 3 | inindi 4187 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶))) | |
| 4 | dfin2 4224 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∩ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) | |
| 5 | invdif 4232 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 6 | invdif 4232 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐶)) = (𝐴 ∖ 𝐶) | |
| 7 | 5, 6 | ineq12i 4171 | . . 3 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∩ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴 ∖ 𝐵) ∩ (𝐴 ∖ 𝐶)) |
| 8 | 3, 4, 7 | 3eqtr3i 2796 | . 2 ⊢ (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∩ (V ∖ 𝐶)))) = ((𝐴 ∖ 𝐵) ∩ (𝐴 ∖ 𝐶)) |
| 9 | 2, 8 | eqtri 2788 | 1 ⊢ (𝐴 ∖ (𝐵 ∪ 𝐶)) = ((𝐴 ∖ 𝐵) ∩ (𝐴 ∖ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Vcvv 3457 ∖ cdif 3903 ∪ cun 3904 ∩ 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-or 862 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-un 3911 df-in 3913 |
| This theorem is used by: undm 4250 uncld 23250 inmbl 25754 difuncomp 32971 clsun 36898 poimirlem8 38338 ntrclskb 44855 ntrclsk3 44856 ntrclsk13 44857 |
| Copyright terms: Public domain | W3C validator |