Metamath Proof Explorer


Theorem sepg

Description: Version of the axiom of separation where the "containing set" is a class variable and the sethood assumption is in the antecedent. (Contributed by NM, 21-Jun-1993) Put sepgi in closed form. (Revised by BJ, 2-Jul-2022)

Ref Expression
Assertion sepg ⊢ A ∈ V → ∃ y ∀ x x ∈ y ↔ x ∈ A ∧ φ

Proof

Step Hyp Ref Expression
1 eleq2 ⊢ z = A → x ∈ z ↔ x ∈ A
2 1 anbi1d ⊢ z = A → x ∈ z ∧ φ ↔ x ∈ A ∧ φ
3 2 bibi2d ⊢ z = A → x ∈ y ↔ x ∈ z ∧ φ ↔ x ∈ y ↔ x ∈ A ∧ φ
4 3 albidv ⊢ z = A → ∀ x x ∈ y ↔ x ∈ z ∧ φ ↔ ∀ x x ∈ y ↔ x ∈ A ∧ φ
5 4 exbidv ⊢ z = A → ∃ y ∀ x x ∈ y ↔ x ∈ z ∧ φ ↔ ∃ y ∀ x x ∈ y ↔ x ∈ A ∧ φ
6 ax-sep ⊢ ∃ y ∀ x x ∈ y ↔ x ∈ z ∧ φ
7 5 6 vtoclg ⊢ A ∈ V → ∃ y ∀ x x ∈ y ↔ x ∈ A ∧ φ