![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > class2seteq | Structured version Visualization version GIF version |
Description: Writing a set as a class abstraction. This theorem looks artificial but was added to characterize the class abstraction whose existence is proved in class2set 5349. (Contributed by NM, 13-Dec-2005.) (Proof shortened by Raph Levien, 30-Jun-2006.) |
Ref | Expression |
---|---|
class2seteq | ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3488 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
2 | ax-1 6 | . . . . 5 ⊢ (𝐴 ∈ V → (𝑥 ∈ 𝐴 → 𝐴 ∈ V)) | |
3 | 2 | ralrimiv 3140 | . . . 4 ⊢ (𝐴 ∈ V → ∀𝑥 ∈ 𝐴 𝐴 ∈ V) |
4 | rabid2 3459 | . . . 4 ⊢ (𝐴 = {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} ↔ ∀𝑥 ∈ 𝐴 𝐴 ∈ V) | |
5 | 3, 4 | sylibr 233 | . . 3 ⊢ (𝐴 ∈ V → 𝐴 = {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V}) |
6 | 5 | eqcomd 2733 | . 2 ⊢ (𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} = 𝐴) |
7 | 1, 6 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝐴 ∈ V} = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1534 ∈ wcel 2099 ∀wral 3056 {crab 3427 Vcvv 3469 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-tru 1537 df-ex 1775 df-nf 1779 df-sb 2061 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ral 3057 df-rab 3428 df-v 3471 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |