| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > n0el | Structured version Visualization version GIF version | ||
| Description: Negated membership of the empty set in another class. (Contributed by Rodolfo Medina, 25-Sep-2010.) |
| Ref | Expression |
|---|---|
| n0el | ⊢ (¬ ∅ ∈ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑢 𝑢 ∈ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 3054 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 2 | df-ex 1787 | . . 3 ⊢ (∃𝑢 𝑢 ∈ 𝑥 ↔ ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥) | |
| 3 | 2 | ralbii 3085 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑢 𝑢 ∈ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥) |
| 4 | alnex 1788 | . . 3 ⊢ (∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥) ↔ ¬ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 5 | imnang 1849 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥) ↔ ∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 6 | 0el 4291 | . . . . 5 ⊢ (∅ ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑢 ¬ 𝑢 ∈ 𝑥) | |
| 7 | df-rex 3064 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑢 ¬ 𝑢 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 8 | 6, 7 | bitri 276 | . . . 4 ⊢ (∅ ∈ 𝐴 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) |
| 9 | 8 | notbii 321 | . . 3 ⊢ (¬ ∅ ∈ 𝐴 ↔ ¬ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) |
| 10 | 4, 5, 9 | 3bitr4ri 305 | . 2 ⊢ (¬ ∅ ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) |
| 11 | 1, 3, 10 | 3bitr4ri 305 | 1 ⊢ (¬ ∅ ∈ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑢 𝑢 ∈ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∀wal 1545 ∃wex 1786 ∈ wcel 2119 ∀wral 3053 ∃wrex 3063 ∅c0 4261 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rex 3064 df-dif 3886 df-nul 4262 |
| This theorem is referenced by: n0el2 38702 prter2 39373 |
| Copyright terms: Public domain | W3C validator |