Theorem wfaxrep 44984

Description: The class of well-founded sets models the Axiom of Replacement ax-rep 5234. 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 44949	. . . 4 ⊢ Tr ∪ (𝑅1 “ On)
3		treq 5222	. . . 4 ⊢ (𝑊 = ∪ (𝑅1 “ On) → (Tr 𝑊 ↔ Tr ∪ (𝑅1 “ On)))
4	2, 3	mpbiri 258	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → Tr 𝑊)
5		vex 3451	. . . . . . . . . 10 ⊢ 𝑓 ∈ V
6	5	rnex 7886	. . . . . . . . 9 ⊢ ran 𝑓 ∈ V
7	6	r1elss 9759	. . . . . . . 8 ⊢ (ran 𝑓 ∈ ∪ (𝑅1 “ On) ↔ ran 𝑓 ⊆ ∪ (𝑅1 “ On))
8	7	biimpri 228	. . . . . . 7 ⊢ (ran 𝑓 ⊆ ∪ (𝑅1 “ On) → ran 𝑓 ∈ ∪ (𝑅1 “ On))
9	1	sseq2i 3976	. . . . . . 7 ⊢ (ran 𝑓 ⊆ 𝑊 ↔ ran 𝑓 ⊆ ∪ (𝑅1 “ On))
10	1	eleq2i 2820	. . . . . . 7 ⊢ (ran 𝑓 ∈ 𝑊 ↔ ran 𝑓 ∈ ∪ (𝑅1 “ On))
11	8, 9, 10	3imtr4i 292	. . . . . 6 ⊢ (ran 𝑓 ⊆ 𝑊 → ran 𝑓 ∈ 𝑊)
12	11	3ad2ant3 1135	. . . . 5 ⊢ ((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑊 ∧ ran 𝑓 ⊆ 𝑊) → ran 𝑓 ∈ 𝑊)
13	12	ax-gen 1795	. . . 4 ⊢ ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑊 ∧ ran 𝑓 ⊆ 𝑊) → ran 𝑓 ∈ 𝑊)
14	13	a1i 11	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → ∀𝑓((Fun 𝑓 ∧ dom 𝑓 ∈ 𝑊 ∧ ran 𝑓 ⊆ 𝑊) → ran 𝑓 ∈ 𝑊))
15		onwf 9783	. . . . 5 ⊢ On ⊆ ∪ (𝑅1 “ On)
16		0elon 6387	. . . . 5 ⊢ ∅ ∈ On
17	15, 16	sselii 3943	. . . 4 ⊢ ∅ ∈ ∪ (𝑅1 “ On)
18		eleq2 2817	. . . 4 ⊢ (𝑊 = ∪ (𝑅1 “ On) → (∅ ∈ 𝑊 ↔ ∅ ∈ ∪ (𝑅1 “ On)))
19	17, 18	mpbiri 258	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → ∅ ∈ 𝑊)
20	4, 14, 19	modelaxrep 44971	. 2 ⊢ (𝑊 = ∪ (𝑅1 “ On) → ∀𝑥 ∈ 𝑊 (∀𝑤 ∈ 𝑊 ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑊 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))
21	1, 20	ax-mp 5	1 ⊢ ∀𝑥 ∈ 𝑊 (∀𝑤 ∈ 𝑊 ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦 ∈ 𝑊 ∀𝑧 ∈ 𝑊 (𝑧 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑊 (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1538   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053   ⊆ wss 3914  ∅c0 4296  ∪ cuni 4871  Tr wtr 5214  dom cdm 5638  ran crn 5639   “ cima 5641  Oncon0 6332  Fun wfun 6505  𝑅₁cr1 9715

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-en 8919  df-dom 8920  df-sdom 8921  df-r1 9717  df-rank 9718

This theorem is referenced by: (None)