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

Theorem hsmexlem6 10533
Description: Lemma for hsmex 10534. (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 6918 . 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 10532 . . . 4 (𝑑 ∈ 𝑆 → (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))
85ssrab3 4010 . . . . . 6 𝑆 ⊆ ∪ (𝑅1 “ On)
98sseli 3909 . . . . 5 (𝑑 ∈ 𝑆 → 𝑑 ∈ ∪ (𝑅1 “ On))
10 harcl 9577 . . . . . 6 (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ On
11 r1fnon 9797 . . . . . . 7 𝑅1 Fn On
1211fndmi 6662 . . . . . 6 dom 𝑅1 = On
1310, 12eleqtrri 2863 . . . . 5 (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1
14 rankr1ag 9834 . . . . 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 3917 . 2 𝑆 ⊆ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻)))
181, 17ssexi 5288 1 𝑆 ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454  𝒫 cpw 4560  {csn 4588  ∪ cuni 4870   class class class wbr 5106   ↦ cmpt 5189   E cep 5554   × cxp 5653  dom cdm 5655  ran crn 5656   ↾ cres 5657   “ cima 5658  Oncon0 6377  ‘cfv 6555  ωcom 7898  reccrdg 8442   ≼ cdom 8996  OrdIsocoi 9527  harchar 9574  TCctc 9759  𝑅1cr1 9790  rankcrnk 9791
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-inf2 9666
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 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-isom 6564  df-riota 7397  df-ov 7443  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-smo 8379  df-recs 8404  df-rdg 8443  df-en 8999  df-dom 9000  df-sdom 9001  df-oi 9528  df-har 9575  df-wdom 9583  df-tc 9760  df-r1 9792  df-rank 9793
This theorem is used by:  hsmex  10534
  Copyright terms: Public domain W3C validator