Theorem axsepg 5241

Description: A more general version of the axiom scheme of separation ax-sep 5240, where variable 𝑧 can also occur (in addition to 𝑥) in formula 𝜑, which can therefore be thought of as 𝜑(𝑥, 𝑧). This version is derived from the more restrictive ax-sep 5240 with no additional set theory axioms. Note that it was also derived from ax-rep 5223 but without ax-sep 5240 as axsepgfromrep 5238. (Contributed by NM, 10-Dec-2006.) (Proof shortened by Mario Carneiro, 17-Nov-2016.) Remove dependency on ax-12 2183 and ax-13 2375 and shorten proof. (Revised by BJ, 6-Oct-2019.)

Assertion

Ref	Expression
axsepg	⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))

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

Allowed substitution hints:   𝜑(𝑥,𝑧)

Proof of Theorem axsepg

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elequ2 2129	. . . . . 6 ⊢ (𝑤 = 𝑧 → (𝑥 ∈ 𝑤 ↔ 𝑥 ∈ 𝑧))
2	1	anbi1d 632	. . . . 5 ⊢ (𝑤 = 𝑧 → ((𝑥 ∈ 𝑤 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
3	2	bibi2d 342	. . . 4 ⊢ (𝑤 = 𝑧 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
4	3	albidv 1922	. . 3 ⊢ (𝑤 = 𝑧 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
5	4	exbidv 1923	. 2 ⊢ (𝑤 = 𝑧 → (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ 𝜑)) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
6		ax-sep 5240	. 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ 𝜑))
7	5, 6	chvarvv 1991	1 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))

Syntax hints:   ↔ wb 206   ∧ wa 395  ∀wal 1540  ∃wex 1781

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-9 2124  ax-sep 5240

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782

This theorem is referenced by: (None)