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

Theorem hsmexlem9 10516
Description: Lemma for hsmex 10523. 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 7916 . 2 (𝑎 ∈ ω → (𝑎 = ∅ ∨ ∃𝑏 ∈ ω 𝑎 = suc 𝑏))
2 fveq2 6896 . . . 4 (𝑎 = ∅ → (𝐻‘𝑎) = (𝐻‘∅))
3 hsmexlem7.h . . . . . 6 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
43hsmexlem7 10514 . . . . 5 (𝐻‘∅) = (har‘𝒫 𝑋)
5 harcl 9566 . . . . 5 (har‘𝒫 𝑋) ∈ On
64, 5eqeltri 2860 . . . 4 (𝐻‘∅) ∈ On
72, 6eqeltrdi 2872 . . 3 (𝑎 = ∅ → (𝐻‘𝑎) ∈ On)
83hsmexlem8 10515 . . . . . 6 (𝑏 ∈ ω → (𝐻‘suc 𝑏) = (har‘𝒫 (𝑋 × (𝐻‘𝑏))))
9 harcl 9566 . . . . . 6 (har‘𝒫 (𝑋 × (𝐻‘𝑏))) ∈ On
108, 9eqeltrdi 2872 . . . . 5 (𝑏 ∈ ω → (𝐻‘suc 𝑏) ∈ On)
11 fveq2 6896 . . . . . 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 1569   ∈ wcel 2146  ∃wrex 3090  Vcvv 3454  ∅c0 4281  𝒫 cpw 4560   ↦ cmpt 5189   × cxp 5653   ↾ cres 5657  Oncon0 6369  suc csuc 6371  ‘cfv 6547  ωcom 7887  reccrdg 8431  harchar 9563
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
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 2101  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-iun 4956  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 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-isom 6556  df-riota 7387  df-ov 7433  df-om 7888  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-en 8988  df-dom 8989  df-oi 9517  df-har 9564
This theorem is used by:  hsmexlem4  10520  hsmexlem5  10521
  Copyright terms: Public domain W3C validator