Theorem zfrep6 7512

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 5094 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 5081. (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		euex 2622	. . . . . . 7 ⊢ (∃!𝑦𝜑 → ∃𝑦𝜑)
2	1	ralimi 3127	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ∀𝑥 ∈ 𝑧 ∃𝑦𝜑)
3		rabid2 3340	. . . . . 6 ⊢ (𝑧 = {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑} ↔ ∀𝑥 ∈ 𝑧 ∃𝑦𝜑)
4	2, 3	sylibr 235	. . . . 5 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → 𝑧 = {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑})
5		19.42v 1931	. . . . . . 7 ⊢ (∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 ∧ ∃𝑦𝜑))
6	5	abbii 2861	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑)} = {𝑥 ∣ (𝑥 ∈ 𝑧 ∧ ∃𝑦𝜑)}
7		dmopab 5670	. . . . . 6 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑)}
8		df-rab 3114	. . . . . 6 ⊢ {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑} = {𝑥 ∣ (𝑥 ∈ 𝑧 ∧ ∃𝑦𝜑)}
9	6, 7, 8	3eqtr4i 2829	. . . . 5 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} = {𝑥 ∈ 𝑧 ∣ ∃𝑦𝜑}
10	4, 9	syl6reqr 2850	. . . 4 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} = 𝑧)
11		vex 3440	. . . 4 ⊢ 𝑧 ∈ V
12	10, 11	syl6eqel 2891	. . 3 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V)
13		eumo 2623	. . . . . . 7 ⊢ (∃!𝑦𝜑 → ∃*𝑦𝜑)
14	13	imim2i 16	. . . . . 6 ⊢ ((𝑥 ∈ 𝑧 → ∃!𝑦𝜑) → (𝑥 ∈ 𝑧 → ∃*𝑦𝜑))
15		moanimv 2672	. . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 → ∃*𝑦𝜑))
16	14, 15	sylibr 235	. . . . 5 ⊢ ((𝑥 ∈ 𝑧 → ∃!𝑦𝜑) → ∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
17	16	alimi 1793	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝑧 → ∃!𝑦𝜑) → ∀𝑥∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
18		df-ral 3110	. . . 4 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ 𝑧 → ∃!𝑦𝜑))
19		funopab 6260	. . . 4 ⊢ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
20	17, 18, 19	3imtr4i 293	. . 3 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)})
21		funrnex 7511	. . 3 ⊢ (dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V → (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V))
22	12, 20, 21	sylc 65	. 2 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∈ V)
23		nfra1 3186	. . 3 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝑧 ∃!𝑦𝜑
24	10	eleq2d 2868	. . . 4 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → (𝑥 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ 𝑥 ∈ 𝑧))
25		opabid 5303	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
26		vex 3440	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
27		vex 3440	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
28	26, 27	opelrn 5695	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → 𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)})
29	25, 28	sylbir 236	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑧 ∧ 𝜑) → 𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)})
30	29	ex 413	. . . . . . 7 ⊢ (𝑥 ∈ 𝑧 → (𝜑 → 𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}))
31	30	impac 553	. . . . . 6 ⊢ ((𝑥 ∈ 𝑧 ∧ 𝜑) → (𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∧ 𝜑))
32	31	eximi 1816	. . . . 5 ⊢ (∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑) → ∃𝑦(𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∧ 𝜑))
33	7	abeq2i 2917	. . . . 5 ⊢ (𝑥 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ↔ ∃𝑦(𝑥 ∈ 𝑧 ∧ 𝜑))
34		df-rex 3111	. . . . 5 ⊢ (∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑 ↔ ∃𝑦(𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} ∧ 𝜑))
35	32, 33, 34	3imtr4i 293	. . . 4 ⊢ (𝑥 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑)
36	24, 35	syl6bir 255	. . 3 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → (𝑥 ∈ 𝑧 → ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑))
37	23, 36	ralrimi 3183	. 2 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑)
38		nfopab1 5031	. . . . 5 ⊢ Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
39	38	nfrn 5706	. . . 4 ⊢ Ⅎ𝑥ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
40	39	nfeq2 2964	. . 3 ⊢ Ⅎ𝑥 𝑤 = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
41		nfcv 2949	. . . 4 ⊢ Ⅎ𝑦𝑤
42		nfopab2 5032	. . . . 5 ⊢ Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
43	42	nfrn 5706	. . . 4 ⊢ Ⅎ𝑦ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}
44	41, 43	rexeqf 3358	. . 3 ⊢ (𝑤 = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → (∃𝑦 ∈ 𝑤 𝜑 ↔ ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑))
45	40, 44	ralbid 3195	. 2 ⊢ (𝑤 = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)} → (∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑤 𝜑 ↔ ∀𝑥 ∈ 𝑧 ∃𝑦 ∈ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑧 ∧ 𝜑)}𝜑))
46	22, 37, 45	elabd 3606	1 ⊢ (∀𝑥 ∈ 𝑧 ∃!𝑦𝜑 → ∃𝑤∀𝑥 ∈ 𝑧 ∃𝑦 ∈ 𝑤 𝜑)

Syntax hints:   → wi 4   ∧ wa 396  ∀wal 1520   = wceq 1522  ∃wex 1761   ∈ wcel 2081  ∃*wmo 2574  ∃!weu 2611  {cab 2775  ∀wral 3105  ∃wrex 3106  {crab 3109  Vcvv 3437  ⟨cop 4478  {copab 5024  dom cdm 5443  ran crn 5444  Fun wfun 6219

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5081  ax-sep 5094  ax-nul 5101  ax-pr 5221  ax-un 7319

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-nul 4212  df-if 4382  df-sn 4473  df-pr 4475  df-op 4479  df-uni 4746  df-iun 4827  df-br 4963  df-opab 5025  df-mpt 5042  df-id 5348  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233

This theorem is referenced by:  bnj865  31811