Theorem axsepg3 35532

Description: A generalization of ax-sep 5258 in which 𝑦 and 𝑧 need not be distinct. This theorem scheme bundles ax-sep 5258 with the degenerate instance ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑)) which is satisfied by the existence of the empty set. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by BTernaryTau, 3-Aug-2025.) (New usage is discouraged.)

Assertion

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

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

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem axsepg3

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1944	. . 3 ⊢ Ⅎ𝑥 ¬ ∀𝑦 𝑦 = 𝑧
2		nfvd 1945	. . . 4 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦 𝑥 ∈ 𝑤)
3		nfcvf 2951	. . . . . 6 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦𝑧)
4	3	nfcrd 2919	. . . . 5 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦 𝑥 ∈ 𝑧)
5		nfvd 1945	. . . . 5 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦𝜑)
6	4, 5	nfand 1927	. . . 4 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
7	2, 6	nfbid 1932	. . 3 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦(𝑥 ∈ 𝑤 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
8	1, 7	nfald 2361	. 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝑤 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
9		nfvd 1945	. 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑤∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
10		elequ2 2158	. . . . . 6 ⊢ (𝑤 = 𝑦 → (𝑥 ∈ 𝑤 ↔ 𝑥 ∈ 𝑦))
11	10	bibi1d 346	. . . . 5 ⊢ (𝑤 = 𝑦 → ((𝑥 ∈ 𝑤 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
12	11	biimpd 232	. . . 4 ⊢ (𝑤 = 𝑦 → ((𝑥 ∈ 𝑤 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) → (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
13	12	alimdv 1946	. . 3 ⊢ (𝑤 = 𝑦 → (∀𝑥(𝑥 ∈ 𝑤 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) → ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
14	13	a1i 11	. 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → (𝑤 = 𝑦 → (∀𝑥(𝑥 ∈ 𝑤 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) → ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))))
15		elequ2 2158	. . . . . . 7 ⊢ (𝑦 = 𝑧 → (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧))
16	15	anbi1d 642	. . . . . 6 ⊢ (𝑦 = 𝑧 → ((𝑥 ∈ 𝑦 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
17	16	bibi2d 345	. . . . 5 ⊢ (𝑦 = 𝑧 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
18	17	biimpd 232	. . . 4 ⊢ (𝑦 = 𝑧 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑)) → (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
19	18	alimdv 1946	. . 3 ⊢ (𝑦 = 𝑧 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑)) → ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
20	19	sps 2221	. 2 ⊢ (∀𝑦 𝑦 = 𝑧 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑)) → ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))))
21		ax-sep 5258	. 2 ⊢ ∃𝑤∀𝑥(𝑥 ∈ 𝑤 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
22		ax-nul 5270	. . 3 ⊢ ∃𝑦∀𝑥 ¬ 𝑥 ∈ 𝑦
23		id 23	. . . . 5 ⊢ (¬ 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑦)
24	23	bianfd 543	. . . 4 ⊢ (¬ 𝑥 ∈ 𝑦 → (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑)))
25	24	alimi 1841	. . 3 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝑦 → ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑)))
26	22, 25	eximii 1867	. 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑦 ∧ 𝜑))
27	8, 9, 14, 20, 21, 26	dvelimexcasei 35444	1 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1568  ∃wex 1809

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404  ax-sep 5258  ax-nul 5270

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814  df-clel 2838  df-nfc 2912

This theorem is referenced by:  axsepg5  35535