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

Theorem hsmexlem9 10503
Description: Lemma for hsmex 10510. 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 7906 . 2 (𝑎 ∈ ω → (𝑎 = ∅ ∨ ∃𝑏 ∈ ω 𝑎 = suc 𝑏))
2 fveq2 6885 . . . 4 (𝑎 = ∅ → (𝐻‘𝑎) = (𝐻‘∅))
3 hsmexlem7.h . . . . . 6 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
43hsmexlem7 10501 . . . . 5 (𝐻‘∅) = (har‘𝒫 𝑋)
5 harcl 9553 . . . . 5 (har‘𝒫 𝑋) ∈ On
64, 5eqeltri 2857 . . . 4 (𝐻‘∅) ∈ On
72, 6eqeltrdi 2869 . . 3 (𝑎 = ∅ → (𝐻‘𝑎) ∈ On)
83hsmexlem8 10502 . . . . . 6 (𝑏 ∈ ω → (𝐻‘suc 𝑏) = (har‘𝒫 (𝑋 × (𝐻‘𝑏))))
9 harcl 9553 . . . . . 6 (har‘𝒫 (𝑋 × (𝐻‘𝑏))) ∈ On
108, 9eqeltrdi 2869 . . . . 5 (𝑏 ∈ ω → (𝐻‘suc 𝑏) ∈ On)
11 fveq2 6885 . . . . . 6 (𝑎 = suc 𝑏 → (𝐻‘𝑎) = (𝐻‘suc 𝑏))
1211eleq1d 2846 . . . . 5 (𝑎 = suc 𝑏 → ((𝐻‘𝑎) ∈ On ↔ (𝐻‘suc 𝑏) ∈ On))
1310, 12syl5ibrcom 250 . . . 4 (𝑏 ∈ ω → (𝑎 = suc 𝑏 → (𝐻‘𝑎) ∈ On))
1413rexlimiv 3157 . . 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 2145  ∃wrex 3087  Vcvv 3451  ∅c0 4279  𝒫 cpw 4557   ↦ cmpt 5186   × cxp 5649   ↾ cres 5653  Oncon0 6362  suc csuc 6364  ‘cfv 6538  ωcom 7877  reccrdg 8417  harchar 9550
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-en 8974  df-dom 8975  df-oi 9504  df-har 9551
This theorem is used by:  hsmexlem4  10507  hsmexlem5  10508
  Copyright terms: Public domain W3C validator