Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elsymdif | Structured version Visualization version GIF version |
Description: Membership in a symmetric difference. (Contributed by Scott Fenton, 31-Mar-2012.) |
Ref | Expression |
---|---|
elsymdif | ⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ ¬ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elun 4079 | . . 3 ⊢ (𝐴 ∈ ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵)) ↔ (𝐴 ∈ (𝐵 ∖ 𝐶) ∨ 𝐴 ∈ (𝐶 ∖ 𝐵))) | |
2 | eldif 3893 | . . . 4 ⊢ (𝐴 ∈ (𝐵 ∖ 𝐶) ↔ (𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶)) | |
3 | eldif 3893 | . . . 4 ⊢ (𝐴 ∈ (𝐶 ∖ 𝐵) ↔ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵)) | |
4 | 2, 3 | orbi12i 911 | . . 3 ⊢ ((𝐴 ∈ (𝐵 ∖ 𝐶) ∨ 𝐴 ∈ (𝐶 ∖ 𝐵)) ↔ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) ∨ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵))) |
5 | 1, 4 | bitri 274 | . 2 ⊢ (𝐴 ∈ ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵)) ↔ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) ∨ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵))) |
6 | df-symdif 4173 | . . 3 ⊢ (𝐵 △ 𝐶) = ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵)) | |
7 | 6 | eleq2i 2830 | . 2 ⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ 𝐴 ∈ ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵))) |
8 | xor 1011 | . 2 ⊢ (¬ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶) ↔ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) ∨ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵))) | |
9 | 5, 7, 8 | 3bitr4i 302 | 1 ⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ ¬ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 ∧ wa 395 ∨ wo 843 ∈ wcel 2108 ∖ cdif 3880 ∪ cun 3881 △ csymdif 4172 |
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-v 3424 df-dif 3886 df-un 3888 df-symdif 4173 |
This theorem is referenced by: dfsymdif4 4179 elsymdifxor 4180 brsymdif 5129 |
Copyright terms: Public domain | W3C validator |