Theorem modelaxrep 45971

Description: Conditions which guarantee that a class models the Axiom of Replacement ax-rep 5231. Similar to Lemma II.2.4(6) of [Kunen2] p. 111. The first two hypotheses are those in Kunen. The reason for the third hypothesis that our version of Replacement is different from Kunen's (which is zfrep6 5241). If we assumed Regularity, we could eliminate this extra hypothesis, since under Regularity, the empty set is a member of every non-empty transitive class.

Note that, to obtain the relativization of an instance of Replacement to 𝑀, the formula ∀𝑦𝜑 would need to be replaced with ∀𝑦 ∈ 𝑀𝜒, where 𝜒 is 𝜑 with all quantifiers relativized to 𝑀. However, we can obtain this by using 𝑦 ∈ 𝑀 ∧ 𝜒 for 𝜑 in this theorem, so it does establish that all instances of Replacement hold in 𝑀. (Contributed by Eric Schmidt, 29-Sep-2025.)

Hypotheses

Ref	Expression
modelaxrep.1	⊢ (𝜓 → Tr 𝑀)
modelaxrep.2	⊢ (𝜓 → ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀))
modelaxrep.3	⊢ (𝜓 → ∅ ∈ 𝑀)

Assertion

Ref	Expression
modelaxrep	⊢ (𝜓 → ∀𝑥 ∈ 𝑀 (∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑀 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑀   𝑓,𝑀

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑓)   𝜓(𝑥, 𝑦, 𝑧, 𝑤, 𝑓)

Proof of Theorem modelaxrep

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		modelaxrep.1	. 2 ⊢ (𝜓 → Tr 𝑀)
2		modelaxrep.2	. . 3 ⊢ (𝜓 → ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀))
3		funeq 6559	. . . . . 6 ⊢ (𝑓 = 𝑔 → (Fun 𝑓 ↔ Fun 𝑔))
4		dmeq 5884	. . . . . . 7 ⊢ (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
5	4	eleq1d 2845	. . . . . 6 ⊢ (𝑓 = 𝑔 → (dom 𝑓 ∈ 𝑀 ↔ dom 𝑔 ∈ 𝑀))
6		rneq 5917	. . . . . . 7 ⊢ (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
7	6	sseq1d 3939	. . . . . 6 ⊢ (𝑓 = 𝑔 → (ran 𝑓 ⊆ 𝑀 ↔ ran 𝑔 ⊆ 𝑀))
8	3, 5, 7	3anbi123d 1464	. . . . 5 ⊢ (𝑓 = 𝑔 → ((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) ↔ (Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀)))
9	6	eleq1d 2845	. . . . 5 ⊢ (𝑓 = 𝑔 → (ran 𝑓 ∈ 𝑀 ↔ ran 𝑔 ∈ 𝑀))
10	8, 9	imbi12d 347	. . . 4 ⊢ (𝑓 = 𝑔 → (((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀) ↔ ((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)))
11	10	cbvalvw 2068	. . 3 ⊢ (∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑀 ∧ ran 𝑓 ⊆ 𝑀) → ran 𝑓 ∈ 𝑀) ↔ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
12	2, 11	sylib 221	. 2 ⊢ (𝜓 → ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
13		modelaxrep.3	. 2 ⊢ (𝜓 → ∅ ∈ 𝑀)
14		trss 5221	. . . . . . 7 ⊢ (Tr 𝑀 → (𝑥 ∈ 𝑀 → 𝑥 ⊆ 𝑀))
15	14	imp 412	. . . . . 6 ⊢ ((Tr 𝑀 ∧ 𝑥 ∈ 𝑀) → 𝑥 ⊆ 𝑀)
16	15	ad5ant14 770	. . . . 5 ⊢ (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)) → 𝑥 ⊆ 𝑀)
17		simp-4r 796	. . . . 5 ⊢ (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)) → ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀))
18		simpllr 788	. . . . 5 ⊢ (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)) → ∅ ∈ 𝑀)
19		simplr 781	. . . . 5 ⊢ (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)) → 𝑥 ∈ 𝑀)
20		nfv 1946	. . . . . 6 ⊢ Ⅎ𝑤(((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀)
21		nfra1 3286	. . . . . 6 ⊢ Ⅎ𝑤∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)
22	20, 21	nfan 1931	. . . . 5 ⊢ Ⅎ𝑤((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦))
23		nfv 1946	. . . . . 6 ⊢ Ⅎ𝑧(((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀)
24		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑧𝑀
25		nfra1 3286	. . . . . . . 8 ⊢ Ⅎ𝑧∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)
26	24, 25	nfrexw 3310	. . . . . . 7 ⊢ Ⅎ𝑧∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)
27	24, 26	nfralw 3309	. . . . . 6 ⊢ Ⅎ𝑧∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)
28	23, 27	nfan 1931	. . . . 5 ⊢ Ⅎ𝑧((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦))
29		nfopab2 5175	. . . . 5 ⊢ Ⅎ𝑧{⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ 𝑥 ∧ (𝑧 ∈ 𝑀 ∧ ∀𝑦𝜑))}
30		eqid 2760	. . . . 5 ⊢ {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ 𝑥 ∧ (𝑧 ∈ 𝑀 ∧ ∀𝑦𝜑))} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ 𝑥 ∧ (𝑧 ∈ 𝑀 ∧ ∀𝑦𝜑))}
31		rsp 3250	. . . . . 6 ⊢ (∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦) → (𝑤 ∈ 𝑀 → ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)))
32	31	adantl 487	. . . . 5 ⊢ (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)) → (𝑤 ∈ 𝑀 → ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)))
33	16, 17, 18, 19, 22, 28, 29, 30, 32	modelaxreplem3 45970	. . . 4 ⊢ (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) ∧ ∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦)) → ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑀 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)))
34	33	ex 418	. . 3 ⊢ ((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥 ∈ 𝑀) → (∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑀 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))
35	34	ralrimiva 3154	. 2 ⊢ (((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔 ∈ 𝑀 ∧ ran 𝑔 ⊆ 𝑀) → ran 𝑔 ∈ 𝑀)) ∧ ∅ ∈ 𝑀) → ∀𝑥 ∈ 𝑀 (∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑀 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))
36	1, 12, 13, 35	syl21anc 851	1 ⊢ (𝜓 → ∀𝑥 ∈ 𝑀 (∀𝑤 ∈ 𝑀 ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑀 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1567   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895  ∅c0 4278  {copab 5166  Tr wtr 5211  dom cdm 5650  ran crn 5651  Fun wfun 6532

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-en 8974  df-dom 8975  df-sdom 8976

This theorem is used by:  wfaxrep  45984