Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sels | Structured version Visualization version GIF version |
Description: If a class is a set, then it is a member of a set. (Contributed by BJ, 3-Apr-2019.) |
Ref | Expression |
---|---|
sels | ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝐴 ∈ 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snidg 4599 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴}) | |
2 | snex 5332 | . . 3 ⊢ {𝐴} ∈ V | |
3 | eleq2 2901 | . . 3 ⊢ (𝑥 = {𝐴} → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ {𝐴})) | |
4 | 2, 3 | spcev 3607 | . 2 ⊢ (𝐴 ∈ {𝐴} → ∃𝑥 𝐴 ∈ 𝑥) |
5 | 1, 4 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝐴 ∈ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∃wex 1780 ∈ wcel 2114 {csn 4567 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-dif 3939 df-un 3941 df-nul 4292 df-sn 4568 df-pr 4570 |
This theorem is referenced by: sat1el2xp 32626 |
Copyright terms: Public domain | W3C validator |