Theorem axrep2 5246

Description: Axiom of Replacement expressed with the fewest number of different variables and without any restrictions on 𝜑. (Contributed by NM, 15-Aug-2003.) Remove dependency on ax-13 2407. (Revised by BJ, 31-May-2019.)

Assertion

Ref	Expression
axrep2	⊢ ∃𝑥(∃𝑦∀𝑧(𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑)))

Distinct variable group:   𝑥,𝑦,𝑧

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

Proof of Theorem axrep2

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfe1 2188	. . . . 5 ⊢ Ⅎ𝑤∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤)
2		nfv 1947	. . . . 5 ⊢ Ⅎ𝑤∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑))
3	1, 2	nfim 1929	. . . 4 ⊢ Ⅎ𝑤(∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑)))
4	3	nfex 2360	. . 3 ⊢ Ⅎ𝑤∃𝑥(∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑)))
5		axreplem 5245	. . 3 ⊢ (𝑤 = 𝑦 → (∃𝑥(∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑤 ∧ ∀𝑦𝜑))) ↔ ∃𝑥(∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑)))))
6		axrep1 5244	. . 3 ⊢ ∃𝑥(∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑤 ∧ ∀𝑦𝜑)))
7	4, 5, 6	chvarfv 2279	. 2 ⊢ ∃𝑥(∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑)))
8		sp 2222	. . . . . . 7 ⊢ (∀𝑦𝜑 → 𝜑)
9	8	imim1i 64	. . . . . 6 ⊢ ((𝜑 → 𝑧 = 𝑦) → (∀𝑦𝜑 → 𝑧 = 𝑦))
10	9	alimi 1844	. . . . 5 ⊢ (∀𝑧(𝜑 → 𝑧 = 𝑦) → ∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦))
11	10	eximi 1868	. . . 4 ⊢ (∃𝑦∀𝑧(𝜑 → 𝑧 = 𝑦) → ∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦))
12		nfv 1947	. . . . 5 ⊢ Ⅎ𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦)
13		nfa1 2189	. . . . . . 7 ⊢ Ⅎ𝑦∀𝑦𝜑
14		nfv 1947	. . . . . . 7 ⊢ Ⅎ𝑦 𝑧 = 𝑤
15	13, 14	nfim 1929	. . . . . 6 ⊢ Ⅎ𝑦(∀𝑦𝜑 → 𝑧 = 𝑤)
16	15	nfal 2359	. . . . 5 ⊢ Ⅎ𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤)
17		equequ2 2059	. . . . . . 7 ⊢ (𝑦 = 𝑤 → (𝑧 = 𝑦 ↔ 𝑧 = 𝑤))
18	17	imbi2d 343	. . . . . 6 ⊢ (𝑦 = 𝑤 → ((∀𝑦𝜑 → 𝑧 = 𝑦) ↔ (∀𝑦𝜑 → 𝑧 = 𝑤)))
19	18	albidv 1953	. . . . 5 ⊢ (𝑦 = 𝑤 → (∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) ↔ ∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤)))
20	12, 16, 19	cbvexv1 2377	. . . 4 ⊢ (∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) ↔ ∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤))
21	11, 20	sylib 221	. . 3 ⊢ (∃𝑦∀𝑧(𝜑 → 𝑧 = 𝑦) → ∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤))
22	21	imim1i 64	. 2 ⊢ ((∃𝑤∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑤) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑))) → (∃𝑦∀𝑧(𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑))))
23	7, 22	eximii 1870	1 ⊢ ∃𝑥(∃𝑦∀𝑧(𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑦 ∧ ∀𝑦𝜑)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812

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 1943  ax-6 2000  ax-7 2041  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-rep 5243

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817

This theorem is used by:  axrep3  5247  axrepndlem1  10595