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 4277 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) | |
2 | nel0.1 | . 2 ⊢ ¬ 𝑥 ∈ 𝐴 | |
3 | 1, 2 | mpgbir 1802 | 1 ⊢ 𝐴 = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1539 ∈ wcel 2106 ∅c0 4256 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-dif 3890 df-nul 4257 |
This theorem is referenced by: iun0 4991 0iun 4992 0xp 5685 dm0 5829 cnv0 6044 fzouzdisj 13423 bj-ccinftydisj 35384 finxp0 35562 stoweidlem44 43585 |
Copyright terms: Public domain | W3C validator |