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

Theorem n0sbday 28330
Description: A non-negative surreal integer has a finite birthday. (Contributed by Scott Fenton, 18-Apr-2025.)
Assertion
Ref Expression
n0sbday (𝐴 ∈ ℕ0s → ( bday 𝐴) ∈ ω)

Proof of Theorem n0sbday
Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6833 . . 3 (𝑚 = 0s → ( bday 𝑚) = ( bday ‘ 0s ))
21eleq1d 2820 . 2 (𝑚 = 0s → (( bday 𝑚) ∈ ω ↔ ( bday ‘ 0s ) ∈ ω))
3 fveq2 6833 . . 3 (𝑚 = 𝑛 → ( bday 𝑚) = ( bday 𝑛))
43eleq1d 2820 . 2 (𝑚 = 𝑛 → (( bday 𝑚) ∈ ω ↔ ( bday 𝑛) ∈ ω))
5 fveq2 6833 . . 3 (𝑚 = (𝑛 +s 1s ) → ( bday 𝑚) = ( bday ‘(𝑛 +s 1s )))
65eleq1d 2820 . 2 (𝑚 = (𝑛 +s 1s ) → (( bday 𝑚) ∈ ω ↔ ( bday ‘(𝑛 +s 1s )) ∈ ω))
7 fveq2 6833 . . 3 (𝑚 = 𝐴 → ( bday 𝑚) = ( bday 𝐴))
87eleq1d 2820 . 2 (𝑚 = 𝐴 → (( bday 𝑚) ∈ ω ↔ ( bday 𝐴) ∈ ω))
9 bday0s 27807 . . 3 ( bday ‘ 0s ) = ∅
10 peano1 7831 . . 3 ∅ ∈ ω
119, 10eqeltri 2831 . 2 ( bday ‘ 0s ) ∈ ω
12 n0scut2 28313 . . . . . . 7 (𝑛 ∈ ℕ0s → (𝑛 +s 1s ) = ({𝑛} |s ∅))
1312fveq2d 6837 . . . . . 6 (𝑛 ∈ ℕ0s → ( bday ‘(𝑛 +s 1s )) = ( bday ‘({𝑛} |s ∅)))
14 n0sno 28302 . . . . . . . 8 (𝑛 ∈ ℕ0s𝑛 No )
15 snelpwi 5391 . . . . . . . 8 (𝑛 No → {𝑛} ∈ 𝒫 No )
16 nulssgt 27774 . . . . . . . 8 ({𝑛} ∈ 𝒫 No → {𝑛} <<s ∅)
1714, 15, 163syl 18 . . . . . . 7 (𝑛 ∈ ℕ0s → {𝑛} <<s ∅)
18 un0 4345 . . . . . . . . . 10 ({𝑛} ∪ ∅) = {𝑛}
1918imaeq2i 6016 . . . . . . . . 9 ( bday “ ({𝑛} ∪ ∅)) = ( bday “ {𝑛})
20 bdayfn 27747 . . . . . . . . . 10 bday Fn No
21 fnsnfv 6912 . . . . . . . . . 10 (( bday Fn No 𝑛 No ) → {( bday 𝑛)} = ( bday “ {𝑛}))
2220, 14, 21sylancr 588 . . . . . . . . 9 (𝑛 ∈ ℕ0s → {( bday 𝑛)} = ( bday “ {𝑛}))
2319, 22eqtr4id 2789 . . . . . . . 8 (𝑛 ∈ ℕ0s → ( bday “ ({𝑛} ∪ ∅)) = {( bday 𝑛)})
24 fvex 6846 . . . . . . . . . 10 ( bday 𝑛) ∈ V
2524sucid 6400 . . . . . . . . 9 ( bday 𝑛) ∈ suc ( bday 𝑛)
26 snssi 4763 . . . . . . . . 9 (( bday 𝑛) ∈ suc ( bday 𝑛) → {( bday 𝑛)} ⊆ suc ( bday 𝑛))
2725, 26ax-mp 5 . . . . . . . 8 {( bday 𝑛)} ⊆ suc ( bday 𝑛)
2823, 27eqsstrdi 3977 . . . . . . 7 (𝑛 ∈ ℕ0s → ( bday “ ({𝑛} ∪ ∅)) ⊆ suc ( bday 𝑛))
29 bdayelon 27750 . . . . . . . . 9 ( bday 𝑛) ∈ On
3029onsuci 7781 . . . . . . . 8 suc ( bday 𝑛) ∈ On
31 scutbdaybnd 27791 . . . . . . . 8 (({𝑛} <<s ∅ ∧ suc ( bday 𝑛) ∈ On ∧ ( bday “ ({𝑛} ∪ ∅)) ⊆ suc ( bday 𝑛)) → ( bday ‘({𝑛} |s ∅)) ⊆ suc ( bday 𝑛))
3230, 31mp3an2 1452 . . . . . . 7 (({𝑛} <<s ∅ ∧ ( bday “ ({𝑛} ∪ ∅)) ⊆ suc ( bday 𝑛)) → ( bday ‘({𝑛} |s ∅)) ⊆ suc ( bday 𝑛))
3317, 28, 32syl2anc 585 . . . . . 6 (𝑛 ∈ ℕ0s → ( bday ‘({𝑛} |s ∅)) ⊆ suc ( bday 𝑛))
3413, 33eqsstrd 3967 . . . . 5 (𝑛 ∈ ℕ0s → ( bday ‘(𝑛 +s 1s )) ⊆ suc ( bday 𝑛))
35 bdayelon 27750 . . . . . 6 ( bday ‘(𝑛 +s 1s )) ∈ On
36 onsssuc 6408 . . . . . 6 ((( bday ‘(𝑛 +s 1s )) ∈ On ∧ suc ( bday 𝑛) ∈ On) → (( bday ‘(𝑛 +s 1s )) ⊆ suc ( bday 𝑛) ↔ ( bday ‘(𝑛 +s 1s )) ∈ suc suc ( bday 𝑛)))
3735, 30, 36mp2an 693 . . . . 5 (( bday ‘(𝑛 +s 1s )) ⊆ suc ( bday 𝑛) ↔ ( bday ‘(𝑛 +s 1s )) ∈ suc suc ( bday 𝑛))
3834, 37sylib 218 . . . 4 (𝑛 ∈ ℕ0s → ( bday ‘(𝑛 +s 1s )) ∈ suc suc ( bday 𝑛))
39 peano2 7832 . . . . 5 (( bday 𝑛) ∈ ω → suc ( bday 𝑛) ∈ ω)
40 peano2 7832 . . . . 5 (suc ( bday 𝑛) ∈ ω → suc suc ( bday 𝑛) ∈ ω)
4139, 40syl 17 . . . 4 (( bday 𝑛) ∈ ω → suc suc ( bday 𝑛) ∈ ω)
42 elnn 7819 . . . 4 ((( bday ‘(𝑛 +s 1s )) ∈ suc suc ( bday 𝑛) ∧ suc suc ( bday 𝑛) ∈ ω) → ( bday ‘(𝑛 +s 1s )) ∈ ω)
4338, 41, 42syl2an 597 . . 3 ((𝑛 ∈ ℕ0s ∧ ( bday 𝑛) ∈ ω) → ( bday ‘(𝑛 +s 1s )) ∈ ω)
4443ex 412 . 2 (𝑛 ∈ ℕ0s → (( bday 𝑛) ∈ ω → ( bday ‘(𝑛 +s 1s )) ∈ ω))
452, 4, 6, 8, 11, 44n0sind 28311 1 (𝐴 ∈ ℕ0s → ( bday 𝐴) ∈ ω)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  cun 3898  wss 3900  c0 4284  𝒫 cpw 4553  {csn 4579   class class class wbr 5097  cima 5626  Oncon0 6316  suc csuc 6318   Fn wfn 6486  cfv 6491  (class class class)co 7358  ωcom 7808   No csur 27609   bday cbday 27611   <<s csslt 27755   |s cscut 27757   0s c0s 27801   1s c1s 27802   +s cadds 27939  0scnn0s 28291
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-rep 5223  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3349  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-ot 4588  df-uni 4863  df-int 4902  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-se 5577  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-2o 8398  df-nadd 8594  df-no 27612  df-slt 27613  df-bday 27614  df-sle 27715  df-sslt 27756  df-scut 27758  df-0s 27803  df-1s 27804  df-made 27823  df-old 27824  df-left 27826  df-right 27827  df-norec 27918  df-norec2 27929  df-adds 27940  df-negs 28001  df-subs 28002  df-n0s 28293
This theorem is referenced by:  n0ssoldg  28331  onltn0s  28335  bdayn0sf1o  28347  zsbday  28383  bdayfinbndlem1  28444  zs12bdaylem  28461
  Copyright terms: Public domain W3C validator