| 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 5271, we invoke the Axiom of Extensionality
(indirectly via
vtocl 3542), 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 5338 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 2824 | . . . . . 6 ⊢ (𝑧 = 𝐴 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝐴)) | |
| 3 | 2 | anbi1d 631 | . . . . 5 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))) |
| 4 | 3 | bibi2d 342 | . . . 4 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))) |
| 5 | 4 | albidv 1920 | . . 3 ⊢ (𝑧 = 𝐴 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))) |
| 6 | 5 | exbidv 1921 | . 2 ⊢ (𝑧 = 𝐴 → (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))) |
| 7 | ax-sep 5271 | . 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) | |
| 8 | 1, 6, 7 | vtocl 3542 | 1 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∀wal 1538 = wceq 1540 ∃wex 1779 ∈ wcel 2109 Vcvv 3464 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 ax-sep 5271 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-cleq 2728 df-clel 2810 |
| This theorem is referenced by: inex1 5292 |
| Copyright terms: Public domain | W3C validator |