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

Theorem hsmex 10549
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 9623. (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 5112 . . . . 5 (𝑎 = 𝑋 → (𝑥 ≼ 𝑎 ↔ 𝑥 ≼ 𝑋))
21ralbidv 3189 . . . 4 (𝑎 = 𝑋 → (∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎 ↔ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋))
32rabbidv 3423 . . 3 (𝑎 = 𝑋 → {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} = {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋})
43eleq1d 2849 . 2 (𝑎 = 𝑋 → ({𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} ∈ V ↔ {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋} ∈ V))
5 vex 3458 . . 3 𝑎 ∈ V
6 eqid 2763 . . 3 (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω) = (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω)
7 rdgeq2 8458 . . . . . 6 (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) = rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏))
8 unieq 4883 . . . . . . . 8 (𝑓 = 𝑐 → ∪ 𝑓 = ∪ 𝑐)
98cbvmptv 5215 . . . . . . 7 (𝑓 ∈ V ↦ ∪ 𝑓) = (𝑐 ∈ V ↦ ∪ 𝑐)
10 rdgeq1 8457 . . . . . . 7 ((𝑓 ∈ V ↦ ∪ 𝑓) = (𝑐 ∈ V ↦ ∪ 𝑐) → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏))
119, 10ax-mp 5 . . . . . 6 rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏)
127, 11eqtrdi 2814 . . . . 5 (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏))
1312reseq1d 5985 . . . 4 (𝑒 = 𝑏 → (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω) = (rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏) ↾ ω))
1413cbvmptv 5215 . . 3 (𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω)) = (𝑏 ∈ V ↦ (rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏) ↾ ω))
15 eqid 2763 . . 3 {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} = {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎}
16 eqid 2763 . . 3 OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦))) = OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦)))
175, 6, 14, 15, 16hsmexlem6 10548 . 2 {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} ∈ V
184, 17vtoclg 3521 1 (𝑋 ∈ 𝑉 → {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋} ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454  𝒫 cpw 4560  {csn 4588  ∪ cuni 4872   class class class wbr 5108   ↦ cmpt 5192   E cep 5557   × cxp 5656   ↾ cres 5660   “ cima 5661  Oncon0 6388  ‘cfv 6566  ωcom 7911  reccrdg 8455   ≼ cdom 9009  OrdIsocoi 9540  harchar 9587  TCctc 9772  𝑅1cr1 9803  rankcrnk 9804
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-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679
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 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-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  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-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-smo 8392  df-recs 8417  df-rdg 8456  df-en 9012  df-dom 9013  df-sdom 9014  df-oi 9541  df-har 9588  df-wdom 9596  df-tc 9773  df-r1 9805  df-rank 9806
This theorem is used by:  hsmex2  10550
  Copyright terms: Public domain W3C validator