Theorem wfaxrep 45804

Description: The class of well-founded sets models the Axiom of Replacement ax-rep 5236. 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 45769	. . . 4 ⊢ Tr ∪ (𝑅1 “ On)
3		treq 5223	. . . 4 ⊢ (𝑊 = ∪ (𝑅1 “ On) → (Tr 𝑊 ↔ Tr ∪ (𝑅1 “ On)))
4	2, 3	mpbiri 261	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → Tr 𝑊)
5		vex 3457	. . . . . . . . . 10 ⊢ 𝑓 ∈ V
6	5	rnex 7910	. . . . . . . . 9 ⊢ ran 𝑓 ∈ V
7	6	r1elss 9791	. . . . . . . 8 ⊢ (ran 𝑓 ∈ ∪ (𝑅1 “ On) ↔ ran 𝑓 ⊆ ∪ (𝑅1 “ On))
8	7	biimpri 231	. . . . . . 7 ⊢ (ran 𝑓 ⊆ ∪ (𝑅1 “ On) → ran 𝑓 ∈ ∪ (𝑅1 “ On))
9	1	sseq2i 3963	. . . . . . 7 ⊢ (ran 𝑓 ⊆ 𝑊 ↔ ran 𝑓 ⊆ ∪ (𝑅1 “ On))
10	1	eleq2i 2854	. . . . . . 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 9815	. . . . 5 ⊢ On ⊆ ∪ (𝑅1 “ On)
16		0elon 6417	. . . . 5 ⊢ ∅ ∈ On
17	15, 16	sselii 3931	. . . 4 ⊢ ∅ ∈ ∪ (𝑅1 “ On)
18		eleq2 2851	. . . 4 ⊢ (𝑊 = ∪ (𝑅1 “ On) → (∅ ∈ 𝑊 ↔ ∅ ∈ ∪ (𝑅1 “ On)))
19	17, 18	mpbiri 261	. . 3 ⊢ (𝑊 = ∪ (𝑅1 “ On) → ∅ ∈ 𝑊)
20	4, 14, 19	modelaxrep 45791	. 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 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902  ∅c0 4282  ∪ cuni 4870  Tr wtr 5216  dom cdm 5659  ran crn 5660   “ cima 5662  Oncon0 6361  Fun wfun 6531  𝑅₁cr1 9747

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-en 8956  df-dom 8957  df-sdom 8958  df-r1 9749  df-rank 9750

This theorem is used by: (None)