Theorem sepg 5254

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 5255 in closed form. (Revised by BJ, 2-Jul-2022.)

Assertion

Ref	Expression
sepg	⊢ (𝐴 ∈ 𝑉 → ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))

Distinct variable groups:   𝑥,𝐴,𝑦   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥, 𝑦)

Proof of Theorem sepg

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2853	. . . . . 6 ⊢ (𝑧 = 𝐴 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝐴))
2	1	anbi1d 643	. . . . 5 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))
3	2	bibi2d 345	. . . 4 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
4	3	albidv 1955	. . 3 ⊢ (𝑧 = 𝐴 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
5	4	exbidv 1956	. 2 ⊢ (𝑧 = 𝐴 → (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
6		ax-sep 5252	. 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
7	5, 6	vtoclg 3521	1 ⊢ (𝐴 ∈ 𝑉 → ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839

This theorem is used by:  sepgi  5255  bj-inex1gALT  38014