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

Theorem hsmex 10517
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 9593. (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 5106 . . . . 5 (𝑎 = 𝑋 → (𝑥 ≼ 𝑎 ↔ 𝑥 ≼ 𝑋))
21ralbidv 3185 . . . 4 (𝑎 = 𝑋 → (∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎 ↔ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋))
32rabbidv 3419 . . 3 (𝑎 = 𝑋 → {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} = {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋})
43eleq1d 2845 . 2 (𝑎 = 𝑋 → ({𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} ∈ V ↔ {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋} ∈ V))
5 vex 3454 . . 3 𝑎 ∈ V
6 eqid 2760 . . 3 (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω) = (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω)
7 rdgeq2 8428 . . . . . 6 (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) = rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏))
8 unieq 4877 . . . . . . . 8 (𝑓 = 𝑐 → ∪ 𝑓 = ∪ 𝑐)
98cbvmptv 5208 . . . . . . 7 (𝑓 ∈ V ↦ ∪ 𝑓) = (𝑐 ∈ V ↦ ∪ 𝑐)
10 rdgeq1 8427 . . . . . . 7 ((𝑓 ∈ V ↦ ∪ 𝑓) = (𝑐 ∈ V ↦ ∪ 𝑐) → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏))
119, 10ax-mp 5 . . . . . 6 rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏)
127, 11eqtrdi 2811 . . . . 5 (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏))
1312reseq1d 5970 . . . 4 (𝑒 = 𝑏 → (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω) = (rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏) ↾ ω))
1413cbvmptv 5208 . . 3 (𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω)) = (𝑏 ∈ V ↦ (rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏) ↾ ω))
15 eqid 2760 . . 3 {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} = {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎}
16 eqid 2760 . . 3 OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦))) = OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦)))
175, 6, 14, 15, 16hsmexlem6 10516 . 2 {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} ∈ V
184, 17vtoclg 3517 1 (𝑋 ∈ 𝑉 → {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋} ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450  𝒫 cpw 4556  {csn 4584  ∪ cuni 4866   class class class wbr 5102   ↦ cmpt 5185   E cep 5550   × cxp 5649   ↾ cres 5653   “ cima 5654  Oncon0 6365  ‘cfv 6543  ωcom 7881  reccrdg 8425   ≼ cdom 8979  OrdIsocoi 9510  harchar 9557  TCctc 9742  𝑅1cr1 9773  rankcrnk 9774
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-inf2 9649
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7381  df-ov 7427  df-om 7882  df-1st 8005  df-2nd 8006  df-frecs 8307  df-wrecs 8338  df-smo 8362  df-recs 8387  df-rdg 8426  df-en 8982  df-dom 8983  df-sdom 8984  df-oi 9511  df-har 9558  df-wdom 9566  df-tc 9743  df-r1 9775  df-rank 9776
This theorem is used by:  hsmex2  10518
  Copyright terms: Public domain W3C validator