![]() |
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 4186 | . 2 ⊢ (𝐴 ∪ 𝐵) = (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) | |
2 | dfin2 4187 | . . . 4 ⊢ ((V ∖ 𝐴) ∩ (V ∖ 𝐵)) = ((V ∖ 𝐴) ∖ (V ∖ (V ∖ 𝐵))) | |
3 | ddif 4064 | . . . . 5 ⊢ (V ∖ (V ∖ 𝐵)) = 𝐵 | |
4 | 3 | difeq2i 4047 | . . . 4 ⊢ ((V ∖ 𝐴) ∖ (V ∖ (V ∖ 𝐵))) = ((V ∖ 𝐴) ∖ 𝐵) |
5 | 2, 4 | eqtr2i 2822 | . . 3 ⊢ ((V ∖ 𝐴) ∖ 𝐵) = ((V ∖ 𝐴) ∩ (V ∖ 𝐵)) |
6 | 5 | difeq2i 4047 | . 2 ⊢ (V ∖ ((V ∖ 𝐴) ∖ 𝐵)) = (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))) |
7 | 1, 6 | eqtri 2821 | 1 ⊢ (𝐴 ∪ 𝐵) = (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 Vcvv 3441 ∖ cdif 3878 ∪ cun 3879 ∩ cin 3880 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 |
This theorem is referenced by: difundi 4206 unvdif 4381 |
Copyright terms: Public domain | W3C validator |