| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nel0 | Structured version Visualization version GIF version | ||
| Description: From the general negation of membership in 𝐴, infer that 𝐴 is the empty set. (Contributed by BJ, 6-Oct-2018.) |
| Ref | Expression |
|---|---|
| nel0.1 | ⊢ ¬ 𝑥 ∈ 𝐴 |
| Ref | Expression |
|---|---|
| nel0 | ⊢ 𝐴 = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eq0 4304 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) | |
| 2 | nel0.1 | . 2 ⊢ ¬ 𝑥 ∈ 𝐴 | |
| 3 | 1, 2 | mpgbir 1829 | 1 ⊢ 𝐴 = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1570 ∈ wcel 2143 ∅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-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-dif 3908 df-nul 4287 |
| This theorem is referenced by: uni0 4901 iun0 5026 0iun 5027 0xp 5760 xp0 5761 cnv0 5869 cnv0OLD 5870 dm0 5910 fzouzdisj 13720 bj-ccinftydisj 37877 finxp0 38057 stoweidlem44 46778 |
| Copyright terms: Public domain | W3C validator |