Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > class2set | Structured version Visualization version GIF version |
Description: Construct, from any class 𝐴, a set equal to it when the class exists and equal to the empty set when the class is proper. This theorem shows that the constructed set always exists. (Contributed by NM, 16-Oct-2003.) |
Ref | Expression |
---|---|
class2set | ⊢ {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabexg 5255 | . 2 ⊢ (𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ∈ V) | |
2 | simpl 483 | . . . . 5 ⊢ ((¬ 𝐴 ∈ V ∧ 𝑥 ∈ 𝐴) → ¬ 𝐴 ∈ V) | |
3 | 2 | nrexdv 3198 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ ∃𝑥 ∈ 𝐴 𝐴 ∈ V) |
4 | rabn0 4319 | . . . . 5 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝐴 ∈ V) | |
5 | 4 | necon1bbii 2993 | . . . 4 ⊢ (¬ ∃𝑥 ∈ 𝐴 𝐴 ∈ V ↔ {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} = ∅) |
6 | 3, 5 | sylib 217 | . . 3 ⊢ (¬ 𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} = ∅) |
7 | 0ex 5231 | . . 3 ⊢ ∅ ∈ V | |
8 | 6, 7 | eqeltrdi 2847 | . 2 ⊢ (¬ 𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ∈ V) |
9 | 1, 8 | pm2.61i 182 | 1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1539 ∈ wcel 2106 ∃wrex 3065 {crab 3068 Vcvv 3432 ∅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-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-in 3894 df-ss 3904 df-nul 4257 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |