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 4283 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) | |
2 | nel0.1 | . 2 ⊢ ¬ 𝑥 ∈ 𝐴 | |
3 | 1, 2 | mpgbir 1806 | 1 ⊢ 𝐴 = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1542 ∈ wcel 2110 ∅c0 4262 |
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 1975 ax-7 2015 ax-9 2120 ax-ext 2711 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1545 df-fal 1555 df-ex 1787 df-sb 2072 df-clab 2718 df-cleq 2732 df-dif 3895 df-nul 4263 |
This theorem is referenced by: iun0 4996 0iun 4997 0xp 5685 dm0 5828 cnv0 6043 fzouzdisj 13434 bj-ccinftydisj 35393 finxp0 35571 stoweidlem44 43567 |
Copyright terms: Public domain | W3C validator |