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 4739 | . 2 ⊢ (𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ∈ V) | |
2 | simpl 472 | . . . . 5 ⊢ ((¬ 𝐴 ∈ V ∧ 𝑥 ∈ 𝐴) → ¬ 𝐴 ∈ V) | |
3 | 2 | nrexdv 2984 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ ∃𝑥 ∈ 𝐴 𝐴 ∈ V) |
4 | rabn0 3912 | . . . . 5 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝐴 ∈ V) | |
5 | 4 | necon1bbii 2831 | . . . 4 ⊢ (¬ ∃𝑥 ∈ 𝐴 𝐴 ∈ V ↔ {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} = ∅) |
6 | 3, 5 | sylib 207 | . . 3 ⊢ (¬ 𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} = ∅) |
7 | 0ex 4718 | . . 3 ⊢ ∅ ∈ V | |
8 | 6, 7 | syl6eqel 2696 | . 2 ⊢ (¬ 𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ∈ V) |
9 | 1, 8 | pm2.61i 175 | 1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1475 ∈ wcel 1977 ∃wrex 2897 {crab 2900 Vcvv 3173 ∅c0 3874 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-in 3547 df-ss 3554 df-nul 3875 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |