| 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 3080 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 2 | df-ex 1810 | . . 3 ⊢ (∃𝑢 𝑢 ∈ 𝑥 ↔ ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥) | |
| 3 | 2 | ralbii 3111 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑢 𝑢 ∈ 𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥) |
| 4 | alnex 1811 | . . 3 ⊢ (∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥) ↔ ¬ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 5 | imnang 1872 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥) ↔ ∀𝑥 ¬ (𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 6 | 0el 4318 | . . . . 5 ⊢ (∅ ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑢 ¬ 𝑢 ∈ 𝑥) | |
| 7 | df-rex 3090 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑢 ¬ 𝑢 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) | |
| 8 | 6, 7 | bitri 278 | . . . 4 ⊢ (∅ ∈ 𝐴 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) |
| 9 | 8 | notbii 323 | . . 3 ⊢ (¬ ∅ ∈ 𝐴 ↔ ¬ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) |
| 10 | 4, 5, 9 | 3bitr4ri 307 | . 2 ⊢ (¬ ∅ ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ¬ ∀𝑢 ¬ 𝑢 ∈ 𝑥)) |
| 11 | 1, 3, 10 | 3bitr4ri 307 | 1 ⊢ (¬ ∅ ∈ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑢 𝑢 ∈ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1568 ∃wex 1809 ∈ wcel 2143 ∀wral 3079 ∃wrex 3089 ∅c0 4286 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-dif 3908 df-nul 4287 |
| This theorem is referenced by: n0el2 38984 prter2 39655 |
| Copyright terms: Public domain | W3C validator |