MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  hsmex Structured version   Visualization version   GIF version

Theorem hsmex 10340
Description: The collection of hereditarily size-limited well-founded sets comprise a set. The proof is that of Randall Holmes at http://math.boisestate.edu/~holmes/holmes/hereditary.pdf, with modifications to use Hartogs' theorem instead of the weak variant (inconsequentially weakening some intermediate results), and making the well-foundedness condition explicit to avoid a direct dependence on ax-reg 9495. (Contributed by Stefan O'Rear, 14-Feb-2015.)
Assertion
Ref Expression
hsmex (𝑋𝑉 → {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋} ∈ V)
Distinct variable group:   𝑥,𝑠,𝑋
Allowed substitution hints:   𝑉(𝑥,𝑠)

Proof of Theorem hsmex
Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq2 5100 . . . . 5 (𝑎 = 𝑋 → (𝑥𝑎𝑥𝑋))
21ralbidv 3157 . . . 4 (𝑎 = 𝑋 → (∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎 ↔ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋))
32rabbidv 3404 . . 3 (𝑎 = 𝑋 → {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎} = {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋})
43eleq1d 2819 . 2 (𝑎 = 𝑋 → ({𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎} ∈ V ↔ {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋} ∈ V))
5 vex 3442 . . 3 𝑎 ∈ V
6 eqid 2734 . . 3 (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω) = (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω)
7 rdgeq2 8341 . . . . . 6 (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ 𝑓), 𝑒) = rec((𝑓 ∈ V ↦ 𝑓), 𝑏))
8 unieq 4872 . . . . . . . 8 (𝑓 = 𝑐 𝑓 = 𝑐)
98cbvmptv 5200 . . . . . . 7 (𝑓 ∈ V ↦ 𝑓) = (𝑐 ∈ V ↦ 𝑐)
10 rdgeq1 8340 . . . . . . 7 ((𝑓 ∈ V ↦ 𝑓) = (𝑐 ∈ V ↦ 𝑐) → rec((𝑓 ∈ V ↦ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ 𝑐), 𝑏))
119, 10ax-mp 5 . . . . . 6 rec((𝑓 ∈ V ↦ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ 𝑐), 𝑏)
127, 11eqtrdi 2785 . . . . 5 (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ 𝑓), 𝑒) = rec((𝑐 ∈ V ↦ 𝑐), 𝑏))
1312reseq1d 5935 . . . 4 (𝑒 = 𝑏 → (rec((𝑓 ∈ V ↦ 𝑓), 𝑒) ↾ ω) = (rec((𝑐 ∈ V ↦ 𝑐), 𝑏) ↾ ω))
1413cbvmptv 5200 . . 3 (𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ 𝑓), 𝑒) ↾ ω)) = (𝑏 ∈ V ↦ (rec((𝑐 ∈ V ↦ 𝑐), 𝑏) ↾ ω))
15 eqid 2734 . . 3 {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎} = {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎}
16 eqid 2734 . . 3 OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦))) = OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦)))
175, 6, 14, 15, 16hsmexlem6 10339 . 2 {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎} ∈ V
184, 17vtoclg 3509 1 (𝑋𝑉 → {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  wral 3049  {crab 3397  Vcvv 3438  𝒫 cpw 4552  {csn 4578   cuni 4861   class class class wbr 5096  cmpt 5177   E cep 5521   × cxp 5620  cres 5624  cima 5625  Oncon0 6315  cfv 6490  ωcom 7806  reccrdg 8338  cdom 8879  OrdIsocoi 9412  harchar 9459  TCctc 9641  𝑅1cr1 9672  rankcrnk 9673
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-inf2 9548
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-isom 6499  df-riota 7313  df-ov 7359  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-smo 8276  df-recs 8301  df-rdg 8339  df-en 8882  df-dom 8883  df-sdom 8884  df-oi 9413  df-har 9460  df-wdom 9468  df-tc 9642  df-r1 9674  df-rank 9675
This theorem is referenced by:  hsmex2  10341
  Copyright terms: Public domain W3C validator