| 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 3477 | . 2 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 2 | df-v 3465 | . . . . 5 ⊢ V = {𝑥 ∣ 𝑥 = 𝑥} | |
| 3 | 2 | eqeq2i 2747 | . . . 4 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = V ↔ {𝑥 ∣ ¬ 𝑥 = 𝐴} = {𝑥 ∣ 𝑥 = 𝑥}) |
| 4 | abbib 2803 | . . . . 5 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = {𝑥 ∣ 𝑥 = 𝑥} ↔ ∀𝑥(¬ 𝑥 = 𝐴 ↔ 𝑥 = 𝑥)) | |
| 5 | equid 2010 | . . . . . . 7 ⊢ 𝑥 = 𝑥 | |
| 6 | 5 | tbt 369 | . . . . . 6 ⊢ (¬ 𝑥 = 𝐴 ↔ (¬ 𝑥 = 𝐴 ↔ 𝑥 = 𝑥)) |
| 7 | 6 | albii 1818 | . . . . 5 ⊢ (∀𝑥 ¬ 𝑥 = 𝐴 ↔ ∀𝑥(¬ 𝑥 = 𝐴 ↔ 𝑥 = 𝑥)) |
| 8 | alnex 1780 | . . . . 5 ⊢ (∀𝑥 ¬ 𝑥 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴) | |
| 9 | 4, 7, 8 | 3bitr2i 299 | . . . 4 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = {𝑥 ∣ 𝑥 = 𝑥} ↔ ¬ ∃𝑥 𝑥 = 𝐴) |
| 10 | 3, 9 | bitri 275 | . . 3 ⊢ ({𝑥 ∣ ¬ 𝑥 = 𝐴} = V ↔ ¬ ∃𝑥 𝑥 = 𝐴) |
| 11 | 10 | necon2abii 2981 | . 2 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ {𝑥 ∣ ¬ 𝑥 = 𝐴} ≠ V) |
| 12 | 1, 11 | bitri 275 | 1 ⊢ (𝐴 ∈ V ↔ {𝑥 ∣ ¬ 𝑥 = 𝐴} ≠ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 ∀wal 1537 = wceq 1539 ∃wex 1778 ∈ wcel 2107 {cab 2712 ≠ wne 2931 Vcvv 3463 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1542 df-ex 1779 df-nf 1783 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-ne 2932 df-v 3465 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |