| 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 4227 | . . 3 ⊢ (𝐵 ∩ 𝐶) = (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) | |
| 2 | 1 | difeq2i 4073 | . 2 ⊢ (𝐴 ∖ (𝐵 ∩ 𝐶)) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) |
| 3 | indi 4234 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶))) | |
| 4 | dfin2 4221 | . . 3 ⊢ (𝐴 ∩ ((V ∖ 𝐵) ∪ (V ∖ 𝐶))) = (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) | |
| 5 | invdif 4229 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 6 | invdif 4229 | . . . 4 ⊢ (𝐴 ∩ (V ∖ 𝐶)) = (𝐴 ∖ 𝐶) | |
| 7 | 5, 6 | uneq12i 4116 | . . 3 ⊢ ((𝐴 ∩ (V ∖ 𝐵)) ∪ (𝐴 ∩ (V ∖ 𝐶))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶)) |
| 8 | 3, 4, 7 | 3eqtr3i 2765 | . 2 ⊢ (𝐴 ∖ (V ∖ ((V ∖ 𝐵) ∪ (V ∖ 𝐶)))) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶)) |
| 9 | 2, 8 | eqtri 2757 | 1 ⊢ (𝐴 ∖ (𝐵 ∩ 𝐶)) = ((𝐴 ∖ 𝐵) ∪ (𝐴 ∖ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 Vcvv 3438 ∖ cdif 3896 ∪ cun 3897 ∩ cin 3898 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 |
| This theorem is referenced by: difdif2 4246 indm 4248 fndifnfp 7120 dprddisj2 19968 fctop 22946 cctop 22948 mretopd 23034 restcld 23114 cfinfil 23835 csdfil 23836 indifundif 32548 difres 32624 unelcarsg 34418 clsk3nimkb 44223 ntrclskb 44252 ntrclsk3 44253 ntrclsk13 44254 salincl 46510 iscnrm3rlem1 49127 |
| Copyright terms: Public domain | W3C validator |