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 44978
Description: Conditions which guarantee that a class models the Axiom of Replacement ax-rep 5237. 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 7936). 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 6539 . . . . . 6 (𝑓 = 𝑔 → (Fun 𝑓 ↔ Fun 𝑔))
4 dmeq 5870 . . . . . . 7 (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
54eleq1d 2814 . . . . . 6 (𝑓 = 𝑔 → (dom 𝑓𝑀 ↔ dom 𝑔𝑀))
6 rneq 5903 . . . . . . 7 (𝑓 = 𝑔 → ran 𝑓 = ran 𝑔)
76sseq1d 3981 . . . . . 6 (𝑓 = 𝑔 → (ran 𝑓𝑀 ↔ ran 𝑔𝑀))
83, 5, 73anbi123d 1438 . . . . 5 (𝑓 = 𝑔 → ((Fun 𝑓 ∧ dom 𝑓𝑀 ∧ ran 𝑓𝑀) ↔ (Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀)))
96eleq1d 2814 . . . . 5 (𝑓 = 𝑔 → (ran 𝑓𝑀 ↔ ran 𝑔𝑀))
108, 9imbi12d 344 . . . 4 (𝑓 = 𝑔 → (((Fun 𝑓 ∧ dom 𝑓𝑀 ∧ ran 𝑓𝑀) → ran 𝑓𝑀) ↔ ((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)))
1110cbvalvw 2036 . . 3 (∀𝑓((Fun 𝑓 ∧ dom 𝑓𝑀 ∧ ran 𝑓𝑀) → ran 𝑓𝑀) ↔ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀))
122, 11sylib 218 . 2 (𝜓 → ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀))
13 modelaxrep.3 . 2 (𝜓 → ∅ ∈ 𝑀)
14 trss 5228 . . . . . . 7 (Tr 𝑀 → (𝑥𝑀𝑥𝑀))
1514imp 406 . . . . . 6 ((Tr 𝑀𝑥𝑀) → 𝑥𝑀)
1615ad5ant14 757 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → 𝑥𝑀)
17 simp-4r 783 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀))
18 simpllr 775 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → ∅ ∈ 𝑀)
19 simplr 768 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → 𝑥𝑀)
20 nfv 1914 . . . . . 6 𝑤(((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀)
21 nfra1 3262 . . . . . 6 𝑤𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2220, 21nfan 1899 . . . . 5 𝑤((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦))
23 nfv 1914 . . . . . 6 𝑧(((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀)
24 nfcv 2892 . . . . . . 7 𝑧𝑀
25 nfra1 3262 . . . . . . . 8 𝑧𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2624, 25nfrexw 3289 . . . . . . 7 𝑧𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2724, 26nfralw 3287 . . . . . 6 𝑧𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)
2823, 27nfan 1899 . . . . 5 𝑧((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦))
29 nfopab2 5181 . . . . 5 𝑧{⟨𝑤, 𝑧⟩ ∣ (𝑤𝑥 ∧ (𝑧𝑀 ∧ ∀𝑦𝜑))}
30 eqid 2730 . . . . 5 {⟨𝑤, 𝑧⟩ ∣ (𝑤𝑥 ∧ (𝑧𝑀 ∧ ∀𝑦𝜑))} = {⟨𝑤, 𝑧⟩ ∣ (𝑤𝑥 ∧ (𝑧𝑀 ∧ ∀𝑦𝜑))}
31 rsp 3226 . . . . . 6 (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → (𝑤𝑀 → ∃𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)))
3231adantl 481 . . . . 5 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → (𝑤𝑀 → ∃𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)))
3316, 17, 18, 19, 22, 28, 29, 30, 32modelaxreplem3 44977 . . . 4 (((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) ∧ ∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦)) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑)))
3433ex 412 . . 3 ((((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) ∧ 𝑥𝑀) → (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑))))
3534ralrimiva 3126 . 2 (((Tr 𝑀 ∧ ∀𝑔((Fun 𝑔 ∧ dom 𝑔𝑀 ∧ ran 𝑔𝑀) → ran 𝑔𝑀)) ∧ ∅ ∈ 𝑀) → ∀𝑥𝑀 (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑))))
361, 12, 13, 35syl21anc 837 1 (𝜓 → ∀𝑥𝑀 (∀𝑤𝑀𝑦𝑀𝑧𝑀 (∀𝑦𝜑𝑧 = 𝑦) → ∃𝑦𝑀𝑧𝑀 (𝑧𝑦 ↔ ∃𝑤𝑀 (𝑤𝑥 ∧ ∀𝑦𝜑))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086  wal 1538  wcel 2109  wral 3045  wrex 3054  wss 3917  c0 4299  {copab 5172  Tr wtr 5217  dom cdm 5641  ran crn 5642  Fun wfun 6508
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 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-en 8922  df-dom 8923  df-sdom 8924
This theorem is referenced by:  wfaxrep  44991
  Copyright terms: Public domain W3C validator