| 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 4106 | . . 3 ⊢ (𝐴 ∈ ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵)) ↔ (𝐴 ∈ (𝐵 ∖ 𝐶) ∨ 𝐴 ∈ (𝐶 ∖ 𝐵))) | |
| 2 | eldif 3914 | . . . 4 ⊢ (𝐴 ∈ (𝐵 ∖ 𝐶) ↔ (𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶)) | |
| 3 | eldif 3914 | . . . 4 ⊢ (𝐴 ∈ (𝐶 ∖ 𝐵) ↔ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵)) | |
| 4 | 2, 3 | orbi12i 925 | . . 3 ⊢ ((𝐴 ∈ (𝐵 ∖ 𝐶) ∨ 𝐴 ∈ (𝐶 ∖ 𝐵)) ↔ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) ∨ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵))) |
| 5 | 1, 4 | bitri 277 | . 2 ⊢ (𝐴 ∈ ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵)) ↔ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) ∨ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵))) |
| 6 | df-symdif 4205 | . . 3 ⊢ (𝐵 △ 𝐶) = ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵)) | |
| 7 | 6 | eleq2i 2854 | . 2 ⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ 𝐴 ∈ ((𝐵 ∖ 𝐶) ∪ (𝐶 ∖ 𝐵))) |
| 8 | xor 1028 | . 2 ⊢ (¬ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶) ↔ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) ∨ (𝐴 ∈ 𝐶 ∧ ¬ 𝐴 ∈ 𝐵))) | |
| 9 | 5, 7, 8 | 3bitr4i 305 | 1 ⊢ (𝐴 ∈ (𝐵 △ 𝐶) ↔ ¬ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∧ wa 399 ∨ wo 858 ∈ wcel 2142 ∖ cdif 3901 ∪ cun 3902 △ csymdif 4204 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1563 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3456 df-dif 3907 df-un 3909 df-symdif 4205 |
| This theorem is referenced by: dfsymdif4 4211 elsymdifxor 4212 brsymdif 5159 |
| Copyright terms: Public domain | W3C validator |