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

Theorem hsmexlem9 10424
Description: Lemma for hsmex 10431. 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 7897 . 2 (𝑎 ∈ ω → (𝑎 = ∅ ∨ ∃𝑏 ∈ ω 𝑎 = suc 𝑏))
2 fveq2 6885 . . . 4 (𝑎 = ∅ → (𝐻𝑎) = (𝐻‘∅))
3 hsmexlem7.h . . . . . 6 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
43hsmexlem7 10422 . . . . 5 (𝐻‘∅) = (har‘𝒫 𝑋)
5 harcl 9528 . . . . 5 (har‘𝒫 𝑋) ∈ On
64, 5eqeltri 2861 . . . 4 (𝐻‘∅) ∈ On
72, 6eqeltrdi 2873 . . 3 (𝑎 = ∅ → (𝐻𝑎) ∈ On)
83hsmexlem8 10423 . . . . . 6 (𝑏 ∈ ω → (𝐻‘suc 𝑏) = (har‘𝒫 (𝑋 × (𝐻𝑏))))
9 harcl 9528 . . . . . 6 (har‘𝒫 (𝑋 × (𝐻𝑏))) ∈ On
108, 9eqeltrdi 2873 . . . . 5 (𝑏 ∈ ω → (𝐻‘suc 𝑏) ∈ On)
11 fveq2 6885 . . . . . 6 (𝑎 = suc 𝑏 → (𝐻𝑎) = (𝐻‘suc 𝑏))
1211eleq1d 2850 . . . . 5 (𝑎 = suc 𝑏 → ((𝐻𝑎) ∈ On ↔ (𝐻‘suc 𝑏) ∈ On))
1310, 12syl5ibrcom 250 . . . 4 (𝑏 ∈ ω → (𝑎 = suc 𝑏 → (𝐻𝑎) ∈ On))
1413rexlimiv 3161 . . 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 2146  wrex 3091  Vcvv 3457  c0 4286  𝒫 cpw 4564  cmpt 5194   × cxp 5661  cres 5665  Oncon0 6364  suc csuc 6366  cfv 6540  ωcom 7868  reccrdg 8402  harchar 9525
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7376  df-ov 7422  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-en 8950  df-dom 8951  df-oi 9479  df-har 9526
This theorem is used by:  hsmexlem4  10428  hsmexlem5  10429
  Copyright terms: Public domain W3C validator