Theorem axsepg 4250

Description: A less restrictive version of the Separation Scheme ax-sep 4249, where variables 𝑥 and 𝑧 can both appear free in the wff 𝜑, which can therefore be thought of as 𝜑(𝑥, 𝑧). This version was derived from the more restrictive ax-sep 4249 with no additional set theory axioms. (Contributed by NM, 10-Dec-2006.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)

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		eleq2 2302	. . . . . . 7 ⊢ (𝑤 = 𝑧 → (𝑥 ∈ 𝑤 ↔ 𝑥 ∈ 𝑧))
2	1	anbi1d 469	. . . . . 6 ⊢ (𝑤 = 𝑧 → ((𝑥 ∈ 𝑤 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑧 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑))))
3		anabs5 579	. . . . . 6 ⊢ ((𝑥 ∈ 𝑧 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
4	2, 3	bitrdi 196	. . . . 5 ⊢ (𝑤 = 𝑧 → ((𝑥 ∈ 𝑤 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
5	4	bibi2d 232	. . . 4 ⊢ (𝑤 = 𝑧 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑))) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
6	5	albidv 1877	. . 3 ⊢ (𝑤 = 𝑧 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑))) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
7	6	exbidv 1878	. 2 ⊢ (𝑤 = 𝑧 → (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑))) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
8		ax-sep 4249	. 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑤 ∧ (𝑥 ∈ 𝑧 ∧ 𝜑)))
9	7, 8	chvarv 1997	1 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))

This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105  ∀wal 1400  ∃wex 1545

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-ext 2220  ax-sep 4249

This proof depends on definitions:  df-bi 117  df-nf 1514  df-cleq 2231  df-clel 2234

This theorem is used by: (None)