| Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > compeq | Structured version Visualization version GIF version | ||
| Description: Equality between two ways of saying "the complement of 𝐴". (Contributed by Andrew Salmon, 15-Jul-2011.) |
| Ref | Expression |
|---|---|
| compeq | ⊢ (V ∖ 𝐴) = {𝑥 ∣ ¬ 𝑥 ∈ 𝐴} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | velcomp 3928 | . 2 ⊢ (𝑥 ∈ (V ∖ 𝐴) ↔ ¬ 𝑥 ∈ 𝐴) | |
| 2 | 1 | eqabi 2904 | 1 ⊢ (V ∖ 𝐴) = {𝑥 ∣ ¬ 𝑥 ∈ 𝐴} |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1567 ∈ wcel 2149 {cab 2747 Vcvv 3463 ∖ cdif 3910 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-v 3465 df-dif 3916 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |