| Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elnev | Structured version Visualization version GIF version | ||
| Description: Any set that contains one element less than the universe is not equal to it. (Contributed by Andrew Salmon, 16-Jun-2011.) |
| Ref | Expression |
|---|---|
| elnev | ⊢ (𝐴 ∈ V ↔ {𝑥 ∣ ¬ 𝑥 = 𝐴} ≠ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isset 3454 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 2 | df-v 3442 | . . . . 5 ⊢ V = {𝑥 ∣ 𝑥 = 𝑥} | |
| 3 | 2 | eqeq2i 2749 | . . . 4 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = V ↔ {𝑥 ∣ ¬ 𝑥 = 𝐴} = {𝑥 ∣ 𝑥 = 𝑥}) |
| 4 | abbib 2805 | . . . . 5 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = {𝑥 ∣ 𝑥 = 𝑥} ↔ ∀𝑥(¬ 𝑥 = 𝐴 ↔ 𝑥 = 𝑥)) | |
| 5 | equid 2013 | . . . . . . 7 ⊢ 𝑥 = 𝑥 | |
| 6 | 5 | tbt 369 | . . . . . 6 ⊢ (¬ 𝑥 = 𝐴 ↔ (¬ 𝑥 = 𝐴 ↔ 𝑥 = 𝑥)) |
| 7 | 6 | albii 1820 | . . . . 5 ⊢ (∀𝑥 ¬ 𝑥 = 𝐴 ↔ ∀𝑥(¬ 𝑥 = 𝐴 ↔ 𝑥 = 𝑥)) |
| 8 | alnex 1782 | . . . . 5 ⊢ (∀𝑥 ¬ 𝑥 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴) | |
| 9 | 4, 7, 8 | 3bitr2i 299 | . . . 4 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = {𝑥 ∣ 𝑥 = 𝑥} ↔ ¬ ∃𝑥 𝑥 = 𝐴) |
| 10 | 3, 9 | bitri 275 | . . 3 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = V ↔ ¬ ∃𝑥 𝑥 = 𝐴) |
| 11 | 10 | necon2abii 2982 | . 2 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ {𝑥 ∣ ¬ 𝑥 = 𝐴} ≠ V) |
| 12 | 1, 11 | bitri 275 | 1 ⊢ (𝐴 ∈ V ↔ {𝑥 ∣ ¬ 𝑥 = 𝐴} ≠ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 ∀wal 1539 = wceq 1541 ∃wex 1780 ∈ wcel 2113 {cab 2714 ≠ wne 2932 Vcvv 3440 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-v 3442 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |