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

Theorem hsmexlem6 10509
Description: Lemma for hsmex 10510. (Contributed by Stefan O'Rear, 14-Feb-2015.)
Hypotheses
Ref Expression
hsmexlem4.x 𝑋 ∈ V
hsmexlem4.h 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
hsmexlem4.u 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
hsmexlem4.s 𝑆 = {𝑎 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑏 ∈ (TC‘{𝑎})𝑏 ≼ 𝑋}
hsmexlem4.o 𝑂 = OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐)))
Assertion
Ref Expression
hsmexlem6 𝑆 ∈ V
Distinct variable groups:   𝑎,𝑐,𝑑,𝐻   𝑆,𝑐,𝑑   𝑈,𝑐,𝑑   𝑎,𝑏,𝑧,𝑋   𝑥,𝑎,𝑦   𝑏,𝑐,𝑑,𝑥,𝑦,𝑧
Allowed substitution hints:   𝑆(𝑥, 𝑦, 𝑧, 𝑎, 𝑏)   𝑈(𝑥, 𝑦, 𝑧, 𝑎, 𝑏)   𝐻(𝑥, 𝑦, 𝑧, 𝑏)   𝑂(𝑥, 𝑦, 𝑧, 𝑎, 𝑏, 𝑐, 𝑑)   𝑋(𝑥, 𝑦, 𝑐, 𝑑)

Proof of Theorem hsmexlem6
StepHypRef Expression
1 fvex 6898 . 2 (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ∈ V
2 hsmexlem4.x . . . . 5 𝑋 ∈ V
3 hsmexlem4.h . . . . 5 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
4 hsmexlem4.u . . . . 5 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
5 hsmexlem4.s . . . . 5 𝑆 = {𝑎 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑏 ∈ (TC‘{𝑎})𝑏 ≼ 𝑋}
6 hsmexlem4.o . . . . 5 𝑂 = OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐)))
72, 3, 4, 5, 6hsmexlem5 10508 . . . 4 (𝑑 ∈ 𝑆 → (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))
85ssrab3 4007 . . . . . 6 𝑆 ⊆ ∪ (𝑅1 “ On)
98sseli 3904 . . . . 5 (𝑑 ∈ 𝑆 → 𝑑 ∈ ∪ (𝑅1 “ On))
10 harcl 9553 . . . . . 6 (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ On
11 r1fnon 9773 . . . . . . 7 𝑅1 Fn On
1211fndmi 6643 . . . . . 6 dom 𝑅1 = On
1310, 12eleqtrri 2859 . . . . 5 (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1
14 rankr1ag 9810 . . . . 5 ((𝑑 ∈ ∪ (𝑅1 “ On) ∧ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1) → (𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ↔ (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻))))
159, 13, 14sylancl 598 . . . 4 (𝑑 ∈ 𝑆 → (𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ↔ (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻))))
167, 15mpbird 260 . . 3 (𝑑 ∈ 𝑆 → 𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))))
1716ssriv 3912 . 2 𝑆 ⊆ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻)))
181, 17ssexi 5283 1 𝑆 ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450  𝒫 cpw 4556  {csn 4583  ∪ cuni 4866   class class class wbr 5102   ↦ cmpt 5185   E cep 5549   × cxp 5648  dom cdm 5650  ran crn 5651   ↾ cres 5652   “ cima 5653  Oncon0 6362  ‘cfv 6538  ωcom 7877  reccrdg 8417   ≼ cdom 8971  OrdIsocoi 9503  harchar 9550  TCctc 9735  𝑅1cr1 9766  rankcrnk 9767
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 5326  ax-pr 5390  ax-un 7751  ax-inf2 9642
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 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  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 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-smo 8354  df-recs 8379  df-rdg 8418  df-en 8974  df-dom 8975  df-sdom 8976  df-oi 9504  df-har 9551  df-wdom 9559  df-tc 9736  df-r1 9768  df-rank 9769
This theorem is used by:  hsmex  10510
  Copyright terms: Public domain W3C validator