Theorem permaxrep 46260

Description: The Axiom of Replacement ax-rep 5238 holds in permutation models. Part of Exercise II.9.2 of [Kunen2] p. 148.

Note that, to prove that an instance of Replacement holds in the model, 𝜑 would need have all instances of ∈ replaced with 𝑅. But this still results in an instance of this theorem, so we do establish that Replacement holds. (Contributed by Eric Schmidt, 6-Nov-2025.)

Hypotheses

Ref	Expression
permmodel.1	⊢ 𝐹:V⟶1-1ontoV
permmodel.2	⊢ 𝑅 = (◡𝐹 ∘ E )

Assertion

Ref	Expression
permaxrep	⊢ (∀𝑤∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦∀𝑧(𝑧𝑅𝑦 ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤   𝑦,𝐹,𝑧,𝑤   𝑦,𝑅

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

Proof of Theorem permaxrep

Step	Hyp	Ref	Expression
1		nfa1 2191	. . . 4 ⊢ Ⅎ𝑦∀𝑦𝜑
2	1	mof 2591	. . 3 ⊢ (∃*𝑧∀𝑦𝜑 ↔ ∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦))
3	2	albii 1852	. 2 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 ↔ ∀𝑤∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦))
4		fvex 6929	. . 3 ⊢ (◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ∈ V
5		nfmo1 2585	. . . . 5 ⊢ Ⅎ𝑧∃*𝑧∀𝑦𝜑
6	5	nfal 2357	. . . 4 ⊢ Ⅎ𝑧∀𝑤∃*𝑧∀𝑦𝜑
7		permmodel.1	. . . . . . 7 ⊢ 𝐹:V⟶1-1ontoV
8		permmodel.2	. . . . . . 7 ⊢ 𝑅 = (◡𝐹 ∘ E )
9		vex 3458	. . . . . . 7 ⊢ 𝑧 ∈ V
10	7, 8, 9, 4	brpermmodel 46257	. . . . . 6 ⊢ (𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ 𝑧 ∈ (𝐹‘(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})))
11		fvex 6929	. . . . . . . . 9 ⊢ (𝐹‘𝑥) ∈ V
12		axrep6g 5249	. . . . . . . . 9 ⊢ (((𝐹‘𝑥) ∈ V ∧ ∀𝑤∃*𝑧∀𝑦𝜑) → {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑} ∈ V)
13	11, 12	mpan 703	. . . . . . . 8 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 → {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑} ∈ V)
14		f1ocnvfv2 7316	. . . . . . . 8 ⊢ ((𝐹:V⟶1-1ontoV ∧ {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑} ∈ V) → (𝐹‘(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})) = {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})
15	7, 13, 14	sylancr 599	. . . . . . 7 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 → (𝐹‘(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})) = {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})
16	15	eleq2d 2850	. . . . . 6 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 → (𝑧 ∈ (𝐹‘(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})) ↔ 𝑧 ∈ {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}))
17	10, 16	bitrid 286	. . . . 5 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 → (𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ 𝑧 ∈ {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}))
18		df-rex 3091	. . . . . 6 ⊢ (∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑 ↔ ∃𝑤(𝑤 ∈ (𝐹‘𝑥) ∧ ∀𝑦𝜑))
19		abid 2745	. . . . . 6 ⊢ (𝑧 ∈ {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑} ↔ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑)
20		vex 3458	. . . . . . . . 9 ⊢ 𝑤 ∈ V
21		vex 3458	. . . . . . . . 9 ⊢ 𝑥 ∈ V
22	7, 8, 20, 21	brpermmodel 46257	. . . . . . . 8 ⊢ (𝑤𝑅𝑥 ↔ 𝑤 ∈ (𝐹‘𝑥))
23	22	anbi1i 636	. . . . . . 7 ⊢ ((𝑤𝑅𝑥 ∧ ∀𝑦𝜑) ↔ (𝑤 ∈ (𝐹‘𝑥) ∧ ∀𝑦𝜑))
24	23	exbii 1881	. . . . . 6 ⊢ (∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑) ↔ ∃𝑤(𝑤 ∈ (𝐹‘𝑥) ∧ ∀𝑦𝜑))
25	18, 19, 24	3bitr4i 306	. . . . 5 ⊢ (𝑧 ∈ {𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑} ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑))
26	17, 25	bitrdi 290	. . . 4 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 → (𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)))
27	6, 26	alrimi 2253	. . 3 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 → ∀𝑧(𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)))
28		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑦◡𝐹
29		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑦(𝐹‘𝑥)
30	29, 1	nfrexw 3314	. . . . . 6 ⊢ Ⅎ𝑦∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑
31	30	nfab 2932	. . . . 5 ⊢ Ⅎ𝑦{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}
32	28, 31	nffv 6926	. . . 4 ⊢ Ⅎ𝑦(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})
33		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑦𝑧
34		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑦𝑅
35	33, 34, 32	nfbr 5158	. . . . . 6 ⊢ Ⅎ𝑦 𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})
36		nfv 1949	. . . . . . . 8 ⊢ Ⅎ𝑦 𝑤𝑅𝑥
37	36, 1	nfan 1934	. . . . . . 7 ⊢ Ⅎ𝑦(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)
38	37	nfex 2358	. . . . . 6 ⊢ Ⅎ𝑦∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)
39	35, 38	nfbi 1938	. . . . 5 ⊢ Ⅎ𝑦(𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑))
40	39	nfal 2357	. . . 4 ⊢ Ⅎ𝑦∀𝑧(𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑))
41		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑧◡𝐹
42		nfab1 2928	. . . . . . 7 ⊢ Ⅎ𝑧{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}
43	41, 42	nffv 6926	. . . . . 6 ⊢ Ⅎ𝑧(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})
44	43	nfeq2 2943	. . . . 5 ⊢ Ⅎ𝑧 𝑦 = (◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})
45		breq2 5112	. . . . . 6 ⊢ (𝑦 = (◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) → (𝑧𝑅𝑦 ↔ 𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑})))
46	45	bibi1d 346	. . . . 5 ⊢ (𝑦 = (◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) → ((𝑧𝑅𝑦 ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)) ↔ (𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑))))
47	44, 46	albid 2262	. . . 4 ⊢ (𝑦 = (◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) → (∀𝑧(𝑧𝑅𝑦 ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)) ↔ ∀𝑧(𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑))))
48	32, 40, 47	spcegf 3550	. . 3 ⊢ ((◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ∈ V → (∀𝑧(𝑧𝑅(◡𝐹‘{𝑧 ∣ ∃𝑤 ∈ (𝐹‘𝑥)∀𝑦𝜑}) ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)) → ∃𝑦∀𝑧(𝑧𝑅𝑦 ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑))))
49	4, 27, 48	mpsyl 69	. 2 ⊢ (∀𝑤∃*𝑧∀𝑦𝜑 → ∃𝑦∀𝑧(𝑧𝑅𝑦 ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)))
50	3, 49	sylbir 238	1 ⊢ (∀𝑤∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦∀𝑧(𝑧𝑅𝑦 ↔ ∃𝑤(𝑤𝑅𝑥 ∧ ∀𝑦𝜑)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃*wmo 2565  {cab 2741  ∃wrex 3090  Vcvv 3454   class class class wbr 5108   E cep 5557  ^◡ccnv 5657   ∘ ccom 5662  ⟶1-1ontowf1o 6565  ‘cfv 6566

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 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-eprel 5558  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574

This theorem is used by: (None)