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

Theorem hsmex 10411
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 9550. (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 5113 . . . . 5 (𝑎 = 𝑋 → (𝑥𝑎𝑥𝑋))
21ralbidv 3188 . . . 4 (𝑎 = 𝑋 → (∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎 ↔ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋))
32rabbidv 3423 . . 3 (𝑎 = 𝑋 → {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎} = {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋})
43eleq1d 2848 . 2 (𝑎 = 𝑋 → ({𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎} ∈ V ↔ {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋} ∈ V))
5 vex 3459 . . 3 𝑎 ∈ V
6 eqid 2763 . . 3 (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω) = (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω)
7 rdgeq2 8395 . . . . . 6 (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ 𝑓), 𝑒) = rec((𝑓 ∈ V ↦ 𝑓), 𝑏))
8 unieq 4883 . . . . . . . 8 (𝑓 = 𝑐 𝑓 = 𝑐)
98cbvmptv 5215 . . . . . . 7 (𝑓 ∈ V ↦ 𝑓) = (𝑐 ∈ V ↦ 𝑐)
10 rdgeq1 8394 . . . . . . 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 5977 . . . 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 10410 . 2 {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑎} ∈ V
184, 17vtoclg 3522 1 (𝑋𝑉 → {𝑠 (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥𝑋} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  wral 3079  {crab 3416  Vcvv 3455  𝒫 cpw 4562  {csn 4589   cuni 4872   class class class wbr 5109  cmpt 5192   E cep 5560   × cxp 5659  cres 5663  cima 5664  Oncon0 6360  cfv 6536  ωcom 7858  reccrdg 8392  cdom 8937  OrdIsocoi 9467  harchar 9514  TCctc 9699  𝑅1cr1 9730  rankcrnk 9731
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-smo 8329  df-recs 8354  df-rdg 8393  df-en 8940  df-dom 8941  df-sdom 8942  df-oi 9468  df-har 9515  df-wdom 9523  df-tc 9700  df-r1 9732  df-rank 9733
This theorem is referenced by:  hsmex2  10412
  Copyright terms: Public domain W3C validator