Users' Mathboxes Mathbox for Eric Schmidt < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  modelaxrep Structured version   Visualization version   GIF version

Theorem modelaxrep 45438
Description: Conditions which guarantee that a class models the Axiom of Replacement ax-rep 5201. 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 5213). 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.
StepHypRef Expression
1 modelaxrep.1 . 2 (𝜓 → Tr 𝑀)
2 modelaxrep.2 . . 3 (𝜓 → ∀𝑓((Fun 𝑓 ∧ dom 𝑓𝑀 ∧ ran 𝑓𝑀) → ran 𝑓𝑀))
3 funeq 6508 . . . . . 6 (𝑓 = 𝑔 → (Fun 𝑓 ↔ Fun 𝑔))
4 dmeq 5851 . . . . . . 7 (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
54eleq1d 2826 . . . . . 6 (𝑓 = 𝑔 → (dom 𝑓𝑀 ↔ dom 𝑔𝑀))
6 rneq 5884 . . . . . . 7 (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
76sseq1d 3947 . . . . . 6 (𝑓 = 𝑔 → (ran 𝑓𝑀 ↔ ran 𝑔𝑀))
83, 5, 73anbi123d 1445 . . . . 5 (𝑓 = 𝑔 → ((Fun 𝑓 ∧ dom 𝑓𝑀 ∧ ran 𝑓𝑀) ↔ (Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀)))
96eleq1d 2826 . . . . 5 (𝑓 = 𝑔 → (ran 𝑓𝑀 ↔ ran 𝑔𝑀))
108, 9imbi12d 346 . . . 4 (𝑓 = 𝑔 → (((Fun 𝑓 ∧ dom 𝑓𝑀 ∧ ran 𝑓𝑀) → ran 𝑓𝑀) ↔ ((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)))
1110cbvalvw 2044 . . 3 (∀𝑓((Fun 𝑓 ∧ dom 𝑓𝑀 ∧ ran 𝑓𝑀) → ran 𝑓𝑀) ↔ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀))
122, 11sylib 220 . 2 (𝜓 → ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀))
13 modelaxrep.3 . 2 (𝜓 → ∅ ∈ 𝑀)
14 trss 5191 . . . . . . 7 (Tr 𝑀 → (𝑥𝑀𝑥𝑀))
1514imp 408 . . . . . 6 ((Tr 𝑀𝑥𝑀) → 𝑥𝑀)
1615ad5ant14 764 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → 𝑥𝑀)
17 simp-4r 790 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀))
18 simpllr 782 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → ∅ ∈ 𝑀)
19 simplr 775 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → 𝑥𝑀)
20 nfv 1922 . . . . . 6 𝑤(((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀)
21 nfra1 3265 . . . . . 6 𝑤𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2220, 21nfan 1907 . . . . 5 𝑤((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦))
23 nfv 1922 . . . . . 6 𝑧(((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀)
24 nfcv 2903 . . . . . . 7 𝑧𝑀
25 nfra1 3265 . . . . . . . 8 𝑧𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2624, 25nfrexw 3289 . . . . . . 7 𝑧𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2724, 26nfralw 3288 . . . . . 6 𝑧𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2823, 27nfan 1907 . . . . 5 𝑧((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦))
29 nfopab2 5145 . . . . 5 𝑧{⟨𝑤, 𝑧⟩ ∣ (𝑤𝑥 ∧ (𝑧𝑀 ∧ ∀𝑦𝜑))}
30 eqid 2741 . . . . 5 {⟨𝑤, 𝑧⟩ ∣ (𝑤𝑥 ∧ (𝑧𝑀 ∧ ∀𝑦𝜑))} = {⟨𝑤, 𝑧⟩ ∣ (𝑤𝑥 ∧ (𝑧𝑀 ∧ ∀𝑦𝜑))}
31 rsp 3229 . . . . . 6 (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → (𝑤𝑀 → ∃𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)))
3231adantl 483 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → (𝑤𝑀 → ∃𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)))
3316, 17, 18, 19, 22, 28, 29, 30, 32modelaxreplem3 45437 . . . 4 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑)))
3433ex 414 . . 3 ((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) → (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑))))
3534ralrimiva 3133 . 2 (((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) → ∀𝑥𝑀 (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑))))
361, 12, 13, 35syl21anc 844 1 (𝜓 → ∀𝑥𝑀 (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397  w3a 1093  wal 1546  wcel 2121  wral 3055  wrex 3065  wss 3884  c0 4263  {copab 5136  Tr wtr 5181  dom cdm 5620  ran crn 5621  Fun wfun 6482
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7681
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-en 8888  df-dom 8889  df-sdom 8890
This theorem is referenced by:  wfaxrep  45451
  Copyright terms: Public domain W3C validator