| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfsymdif3 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the symmetric difference, given in Example 4.1 of [Stoll] p. 262 (the original definition corresponds to [Stoll] p. 13). (Contributed by NM, 17-Aug-2004.) (Revised by BJ, 30-Apr-2020.) |
| Ref | Expression |
|---|---|
| dfsymdif3 | ⊢ (𝐴 △ 𝐵) = ((𝐴 ∪ 𝐵) ∖ (𝐴 ∩ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difin 4220 | . . 3 ⊢ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ 𝐵) | |
| 2 | incom 4109 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
| 3 | 2 | difeq2i 4063 | . . . 4 ⊢ (𝐵 ∖ (𝐴 ∩ 𝐵)) = (𝐵 ∖ (𝐵 ∩ 𝐴)) |
| 4 | difin 4220 | . . . 4 ⊢ (𝐵 ∖ (𝐵 ∩ 𝐴)) = (𝐵 ∖ 𝐴) | |
| 5 | 3, 4 | eqtri 2786 | . . 3 ⊢ (𝐵 ∖ (𝐴 ∩ 𝐵)) = (𝐵 ∖ 𝐴) |
| 6 | 1, 5 | uneq12i 4168 | . 2 ⊢ ((𝐴 ∖ (𝐴 ∩ 𝐵)) ∪ (𝐵 ∖ (𝐴 ∩ 𝐵))) = ((𝐴 ∖ 𝐵) ∪ (𝐵 ∖ 𝐴)) |
| 7 | difundir 4239 | . 2 ⊢ ((𝐴 ∪ 𝐵) ∖ (𝐴 ∩ 𝐵)) = ((𝐴 ∖ (𝐴 ∩ 𝐵)) ∪ (𝐵 ∖ (𝐴 ∩ 𝐵))) | |
| 8 | df-symdif 4201 | . 2 ⊢ (𝐴 △ 𝐵) = ((𝐴 ∖ 𝐵) ∪ (𝐵 ∖ 𝐴)) | |
| 9 | 6, 7, 8 | 3eqtr4ri 2797 | 1 ⊢ (𝐴 △ 𝐵) = ((𝐴 ∪ 𝐵) ∖ (𝐴 ∩ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∖ cdif 4048 ∩ cin 4092 ∪ cun 4152 △ csymdif 4200 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-dif 4050 df-in 4094 df-un 4154 df-symdif 4201 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |