Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfun3 | Structured version Visualization version GIF version |
Description: Union defined in terms of intersection (De Morgan's law). Definition of union in [Mendelson] p. 231. (Contributed by NM, 8-Jan-2002.) |
Ref | Expression |
---|---|
dfun3 | ⊢ (𝐴 ∪ 𝐵) = (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfun2 3821 | . 2 ⊢ (𝐴 ∪ 𝐵) = (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) | |
2 | dfin2 3822 | . . . 4 ⊢ ((V ∖ 𝐴) ∩ (V ∖ 𝐵)) = ((V ∖ 𝐴) ∖ (V ∖ (V ∖ 𝐵))) | |
3 | ddif 3704 | . . . . 5 ⊢ (V ∖ (V ∖ 𝐵)) = 𝐵 | |
4 | 3 | difeq2i 3687 | . . . 4 ⊢ ((V ∖ 𝐴) ∖ (V ∖ (V ∖ 𝐵))) = ((V ∖ 𝐴) ∖ 𝐵) |
5 | 2, 4 | eqtr2i 2633 | . . 3 ⊢ ((V ∖ 𝐴) ∖ 𝐵) = ((V ∖ 𝐴) ∩ (V ∖ 𝐵)) |
6 | 5 | difeq2i 3687 | . 2 ⊢ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) = (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))) |
7 | 1, 6 | eqtri 2632 | 1 ⊢ (𝐴 ∪ 𝐵) = (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 Vcvv 3173 ∖ cdif 3537 ∪ cun 3538 ∩ cin 3539 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 |
This theorem is referenced by: difundi 3838 unvdif 3994 |
Copyright terms: Public domain | W3C validator |