![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > zfausab | Structured version Visualization version GIF version |
Description: Separation Scheme (Aussonderung) in terms of a class abstraction. (Contributed by NM, 8-Jun-1994.) |
Ref | Expression |
---|---|
zfausab.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
zfausab | ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zfausab.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | ssab2 3719 | . 2 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴 | |
3 | 1, 2 | ssexi 4836 | 1 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 383 ∈ wcel 2030 {cab 2637 Vcvv 3231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-v 3233 df-in 3614 df-ss 3621 |
This theorem is referenced by: rabfmpunirn 29581 |
Copyright terms: Public domain | W3C validator |