Theorem zfrep6 7797

Description: A version of the Axiom of Replacement. Normally 𝜑 would have free variables 𝑥 and 𝑦. Axiom 6 of [Kunen] p. 12. The Separation Scheme ax-sep 5223 cannot be derived from this version and must be stated as a separate axiom in an axiom system (such as Kunen's) that uses this version in place of our ax-rep 5209. (Contributed by NM, 10-Oct-2003.)

Assertion

Ref	Expression
zfrep6	⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ∃𝑤∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑤 𝜑)

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

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

Proof of Theorem zfrep6

Step	Hyp	Ref	Expression
1		19.42v 1957	. . . . . . 7 ⊢ (∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 ∧ ∃𝑦𝜑))
2	1	abbii 2808	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑)} = {𝑥 ∣ (𝑥 ∈ 𝑧 ∧ ∃𝑦𝜑)}
3		dmopab 5824	. . . . . 6 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑)}
4		df-rab 3073	. . . . . 6 ⊢ {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑} = {𝑥 ∣ (𝑥 ∈ 𝑧 ∧ ∃𝑦𝜑)}
5	2, 3, 4	3eqtr4i 2776	. . . . 5 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} = {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑}
6		euex 2577	. . . . . . 7 ⊢ (∃!𝑦𝜑 → ∃𝑦𝜑)
7	6	ralimi 3087	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ∀𝑥 ∈ 𝑧 ∃𝑦𝜑)
8		rabid2 3314	. . . . . 6 ⊢ (𝑧 = {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑} ↔ ∀𝑥 ∈ 𝑧 ∃𝑦𝜑)
9	7, 8	sylibr 233	. . . . 5 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → 𝑧 = {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑})
10	5, 9	eqtr4id 2797	. . . 4 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} = 𝑧)
11		vex 3436	. . . 4 ⊢ 𝑧 ∈ V
12	10, 11	eqeltrdi 2847	. . 3 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V)
13		eumo 2578	. . . . . . 7 ⊢ (∃!𝑦𝜑 → ∃*𝑦𝜑)
14	13	imim2i 16	. . . . . 6 ⊢ ((𝑥 ∈ 𝑧 → ∃!𝑦𝜑) → (𝑥 ∈ 𝑧 → ∃*𝑦𝜑))
15		moanimv 2621	. . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 → ∃*𝑦𝜑))
16	14, 15	sylibr 233	. . . . 5 ⊢ ((𝑥 ∈ 𝑧 → ∃!𝑦𝜑) → ∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
17	16	alimi 1814	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝑧 → ∃!𝑦𝜑) → ∀𝑥∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
18		df-ral 3069	. . . 4 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ 𝑧 → ∃!𝑦𝜑))
19		funopab 6469	. . . 4 ⊢ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
20	17, 18, 19	3imtr4i 292	. . 3 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)})
21		funrnex 7796	. . 3 ⊢ (dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V → (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V))
22	12, 20, 21	sylc 65	. 2 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V)
23		nfra1 3144	. . 3 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝑧 ∃!𝑦𝜑
24	10	eleq2d 2824	. . . 4 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → (𝑥 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ 𝑥 ∈ 𝑧))
25		opabidw 5437	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
26		vex 3436	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
27		vex 3436	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
28	26, 27	opelrn 5852	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → 𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)})
29	25, 28	sylbir 234	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑧 ∧ 𝜑) → 𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)})
30	29	ex 413	. . . . . . 7 ⊢ (𝑥 ∈ 𝑧 → (𝜑 → 𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}))
31	30	impac 553	. . . . . 6 ⊢ ((𝑥 ∈ 𝑧 ∧ 𝜑) → (𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∧ 𝜑))
32	31	eximi 1837	. . . . 5 ⊢ (∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑) → ∃𝑦(𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∧ 𝜑))
33	3	abeq2i 2875	. . . . 5 ⊢ (𝑥 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ ∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
34		df-rex 3070	. . . . 5 ⊢ (∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑 ↔ ∃𝑦(𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∧ 𝜑))
35	32, 33, 34	3imtr4i 292	. . . 4 ⊢ (𝑥 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑)
36	24, 35	syl6bir 253	. . 3 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → (𝑥 ∈ 𝑧 → ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑))
37	23, 36	ralrimi 3141	. 2 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑)
38		nfopab1 5144	. . . . 5 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
39	38	nfrn 5861	. . . 4 ⊢ Ⅎ𝑥ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
40	39	nfeq2 2924	. . 3 ⊢ Ⅎ𝑥 𝑤 = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
41		nfcv 2907	. . . 4 ⊢ Ⅎ𝑦𝑤
42		nfopab2 5145	. . . . 5 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
43	42	nfrn 5861	. . . 4 ⊢ Ⅎ𝑦ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
44	41, 43	rexeqf 3333	. . 3 ⊢ (𝑤 = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → (∃𝑦 ∈ 𝑤 𝜑 ↔ ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑))
45	40, 44	ralbid 3161	. 2 ⊢ (𝑤 = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → (∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑤 𝜑 ↔ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑))
46	22, 37, 45	spcedv 3537	1 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ∃𝑤∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑤 𝜑)

Syntax hints:   → wi 4   ∧ wa 396  ∀wal 1537   = wceq 1539  ∃wex 1782   ∈ wcel 2106  ∃*wmo 2538  ∃!weu 2568  {cab 2715  ∀wral 3064  ∃wrex 3065  {crab 3068  Vcvv 3432  ⟨cop 4567  {copab 5136  dom cdm 5589  ran crn 5590  Fun wfun 6427

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441

This theorem is referenced by:  bnj865  32903