Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > difindi | Structured version Visualization version GIF version |
Description: Distributive law for class difference. Theorem 40 of [Suppes] p. 29. (Contributed by NM, 17-Aug-2004.) |
Ref | Expression |
---|---|
difindi | ⊢ (𝐴 ∖ (𝐵 ∩ 𝐶)) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfin3 4197 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) | |
2 | 1 | difeq2i 4050 | . 2 ⊢ (𝐴 ∖ (𝐵 ∩ 𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) |
3 | indi 4204 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶))) | |
4 | dfin2 4191 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) | |
5 | invdif 4199 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
6 | invdif 4199 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐶)) = (𝐴 ∖ 𝐶) | |
7 | 5, 6 | uneq12i 4091 | . . 3 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶)) |
8 | 3, 4, 7 | 3eqtr3i 2774 | . 2 ⊢ (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶)) |
9 | 2, 8 | eqtri 2766 | 1 ⊢ (𝐴 ∖ (𝐵 ∩ 𝐶)) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 Vcvv 3422 ∖ cdif 3880 ∪ cun 3881 ∩ cin 3882 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 |
This theorem is referenced by: difdif2 4217 indm 4219 fndifnfp 7030 dprddisj2 19557 fctop 22062 cctop 22064 mretopd 22151 restcld 22231 cfinfil 22952 csdfil 22953 indifundif 30774 difres 30840 unelcarsg 32179 clsk3nimkb 41539 ntrclskb 41568 ntrclsk3 41569 ntrclsk13 41570 salincl 43754 iscnrm3rlem1 46122 |
Copyright terms: Public domain | W3C validator |