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

Theorem hsmexlem9 10542
Description: Lemma for hsmex 10549. Properties of the recurrent sequence of ordinals. (Contributed by Stefan O'Rear, 14-Feb-2015.)
Hypothesis
Ref Expression
hsmexlem7.h 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
Assertion
Ref Expression
hsmexlem9 (𝑎 ∈ ω → (𝐻‘𝑎) ∈ On)
Distinct variable groups:   𝑧,𝑋   𝑧,𝑎
Allowed substitution hints:   𝐻(𝑧, 𝑎)   𝑋(𝑎)

Proof of Theorem hsmexlem9
Dummy variable 𝑏 is distinct from all other variables.
StepHypRef Expression
1 nn0suc 7940 . 2 (𝑎 ∈ ω → (𝑎 = ∅ ∨ ∃𝑏 ∈ ω 𝑎 = suc 𝑏))
2 fveq2 6916 . . . 4 (𝑎 = ∅ → (𝐻‘𝑎) = (𝐻‘∅))
3 hsmexlem7.h . . . . . 6 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
43hsmexlem7 10540 . . . . 5 (𝐻‘∅) = (har‘𝒫 𝑋)
5 harcl 9590 . . . . 5 (har‘𝒫 𝑋) ∈ On
64, 5eqeltri 2860 . . . 4 (𝐻‘∅) ∈ On
72, 6eqeltrdi 2872 . . 3 (𝑎 = ∅ → (𝐻‘𝑎) ∈ On)
83hsmexlem8 10541 . . . . . 6 (𝑏 ∈ ω → (𝐻‘suc 𝑏) = (har‘𝒫 (𝑋 × (𝐻‘𝑏))))
9 harcl 9590 . . . . . 6 (har‘𝒫 (𝑋 × (𝐻‘𝑏))) ∈ On
108, 9eqeltrdi 2872 . . . . 5 (𝑏 ∈ ω → (𝐻‘suc 𝑏) ∈ On)
11 fveq2 6916 . . . . . 6 (𝑎 = suc 𝑏 → (𝐻‘𝑎) = (𝐻‘suc 𝑏))
1211eleq1d 2849 . . . . 5 (𝑎 = suc 𝑏 → ((𝐻‘𝑎) ∈ On ↔ (𝐻‘suc 𝑏) ∈ On))
1310, 12syl5ibrcom 250 . . . 4 (𝑏 ∈ ω → (𝑎 = suc 𝑏 → (𝐻‘𝑎) ∈ On))
1413rexlimiv 3160 . . 3 (∃𝑏 ∈ ω 𝑎 = suc 𝑏 → (𝐻‘𝑎) ∈ On)
157, 14jaoi 871 . 2 ((𝑎 = ∅ ∨ ∃𝑏 ∈ ω 𝑎 = suc 𝑏) → (𝐻‘𝑎) ∈ On)
161, 15syl 18 1 (𝑎 ∈ ω → (𝐻‘𝑎) ∈ On)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454  ∅c0 4281  𝒫 cpw 4560   ↦ cmpt 5192   × cxp 5656   ↾ cres 5660  Oncon0 6388  suc csuc 6390  ‘cfv 6566  ωcom 7911  reccrdg 8455  harchar 9587
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
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-iun 4958  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-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-en 9012  df-dom 9013  df-oi 9541  df-har 9588
This theorem is used by:  hsmexlem4  10546  hsmexlem5  10547
  Copyright terms: Public domain W3C validator