Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > zfauscl | Structured version Visualization version GIF version |
Description: Separation Scheme
(Aussonderung) using a class variable. To derive this
from ax-sep 5243, we invoke the Axiom of Extensionality
(indirectly via
vtocl 3507), which is needed for the justification of
class variable
notation.
If we omit the requirement that 𝑦 not occur in 𝜑, we can derive a contradiction, as notzfaus 5305 shows. (Contributed by NM, 21-Jun-1993.) |
Ref | Expression |
---|---|
zfauscl.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
zfauscl | ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zfauscl.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | eleq2 2825 | . . . . . 6 ⊢ (𝑧 = 𝐴 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝐴)) | |
3 | 2 | anbi1d 630 | . . . . 5 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))) |
4 | 3 | bibi2d 342 | . . . 4 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))) |
5 | 4 | albidv 1922 | . . 3 ⊢ (𝑧 = 𝐴 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))) |
6 | 5 | exbidv 1923 | . 2 ⊢ (𝑧 = 𝐴 → (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))) |
7 | ax-sep 5243 | . 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) | |
8 | 1, 6, 7 | vtocl 3507 | 1 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 ∀wal 1538 = wceq 1540 ∃wex 1780 ∈ wcel 2105 Vcvv 3441 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2707 ax-sep 5243 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1781 df-cleq 2728 df-clel 2814 |
This theorem is referenced by: inex1 5261 |
Copyright terms: Public domain | W3C validator |