Theorem wfaxrep 46179

Description: The class of well-founded sets models the Axiom of Replacement ax-rep 5235. Actually, our statement is stronger, since it is an instance of Replacement only when all quantifiers in ∀𝑦𝜑 are relativized to 𝑊. Essentially part of Corollary II.2.5 of [Kunen2] p. 112, but note that our Replacement is different from Kunen's. (Contributed by Eric Schmidt, 29-Sep-2025.)

Hypothesis

Ref	Expression
wfax.1	⊢ 𝑊 = ∪ (𝑅1 “ On)

Assertion

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

Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑊

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

Proof of Theorem wfaxrep

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		wfax.1	. 2 ⊢ 𝑊 = ∪ (𝑅1 “ On)
2		trwf 46144	. . . 4 ⊢ Tr ∪ (𝑅1 “ On)
3		treq 5222	. . . 4 ⊢ (𝑊 = ∪ (𝑅1 “ On) → (Tr 𝑊 ↔ Tr ∪ (𝑅1 “ On)))
4	2, 3	mpbiri 261	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → Tr 𝑊)
5		vex 3458	. . . . . . . . . 10 ⊢ 𝑓 ∈ V
6	5	rnex 7946	. . . . . . . . 9 ⊢ ran 𝑓 ∈ V
7	6	r1elss 9841	. . . . . . . 8 ⊢ (ran 𝑓 ∈ ∪ (𝑅1 “ On) ↔ ran 𝑓 ⊆ ∪ (𝑅1 “ On))
8	7	biimpri 231	. . . . . . 7 ⊢ (ran 𝑓 ⊆ ∪ (𝑅1 “ On) → ran 𝑓 ∈ ∪ (𝑅1 “ On))
9	1	sseq2i 3942	. . . . . . 7 ⊢ (ran 𝑓 ⊆ 𝑊 ↔ ran 𝑓 ⊆ ∪ (𝑅1 “ On))
10	1	eleq2i 2856	. . . . . . 7 ⊢ (ran 𝑓 ∈ 𝑊 ↔ ran 𝑓 ∈ ∪ (𝑅1 “ On))
11	8, 9, 10	3imtr4i 295	. . . . . 6 ⊢ (ran 𝑓 ⊆ 𝑊 → ran 𝑓 ∈ 𝑊)
12	11	3ad2ant3 1153	. . . . 5 ⊢ ((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑊 ∧ ran 𝑓 ⊆ 𝑊) → ran 𝑓 ∈ 𝑊)
13	12	ax-gen 1828	. . . 4 ⊢ ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑊 ∧ ran 𝑓 ⊆ 𝑊) → ran 𝑓 ∈ 𝑊)
14	13	a1i 11	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑊 ∧ ran 𝑓 ⊆ 𝑊) → ran 𝑓 ∈ 𝑊))
15		onwf 9867	. . . . 5 ⊢ On ⊆ ∪ (𝑅1 “ On)
16		0elon 6436	. . . . 5 ⊢ ∅ ∈ On
17	15, 16	sselii 3910	. . . 4 ⊢ ∅ ∈ ∪ (𝑅1 “ On)
18		eleq2 2853	. . . 4 ⊢ (𝑊 = ∪ (𝑅1 “ On) → (∅ ∈ 𝑊 ↔ ∅ ∈ ∪ (𝑅1 “ On)))
19	17, 18	mpbiri 261	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → ∅ ∈ 𝑊)
20	4, 14, 19	modelaxrep 46166	. 2 ⊢ (𝑊 = ∪ (𝑅1 “ On) → ∀𝑥 ∈ 𝑊 (∀𝑤 ∈ 𝑊 ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑊 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))
21	1, 20	ax-mp 5	1 ⊢ ∀𝑥 ∈ 𝑊 (∀𝑤 ∈ 𝑊 ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑊 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ∅c0 4281  ∪ cuni 4870  Tr wtr 5215  dom cdm 5655  ran crn 5656   “ cima 5658  Oncon0 6380  Fun wfun 6552  𝑅₁cr1 9793

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-en 9002  df-dom 9003  df-sdom 9004  df-r1 9795  df-rank 9796

This theorem is used by: (None)