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

Theorem scutbdaybnd2lim 27786
Description: An upper bound on the birthday of a surreal cut when it is a limit birthday. (Contributed by Scott Fenton, 7-Aug-2024.)
Assertion
Ref Expression
scutbdaybnd2lim ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday “ (𝐴𝐵)))

Proof of Theorem scutbdaybnd2lim
StepHypRef Expression
1 scutbdaybnd2 27785 . . . 4 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
21adantr 480 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
3 bdayfun 27741 . . . . . . . . 9 Fun bday
4 ssltex1 27755 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐴 ∈ V)
5 ssltex2 27756 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐵 ∈ V)
6 unexg 7742 . . . . . . . . . 10 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
74, 5, 6syl2anc 584 . . . . . . . . 9 (𝐴 <<s 𝐵 → (𝐴𝐵) ∈ V)
8 funimaexg 6628 . . . . . . . . 9 ((Fun bday ∧ (𝐴𝐵) ∈ V) → ( bday “ (𝐴𝐵)) ∈ V)
93, 7, 8sylancr 587 . . . . . . . 8 (𝐴 <<s 𝐵 → ( bday “ (𝐴𝐵)) ∈ V)
109uniexd 7741 . . . . . . 7 (𝐴 <<s 𝐵 ( bday “ (𝐴𝐵)) ∈ V)
1110adantr 480 . . . . . 6 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday “ (𝐴𝐵)) ∈ V)
12 nlimsucg 7842 . . . . . 6 ( ( bday “ (𝐴𝐵)) ∈ V → ¬ Lim suc ( bday “ (𝐴𝐵)))
1311, 12syl 17 . . . . 5 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ¬ Lim suc ( bday “ (𝐴𝐵)))
14 limeq 6369 . . . . . . 7 (( bday ‘(𝐴 |s 𝐵)) = suc ( bday “ (𝐴𝐵)) → (Lim ( bday ‘(𝐴 |s 𝐵)) ↔ Lim suc ( bday “ (𝐴𝐵))))
1514biimpcd 249 . . . . . 6 (Lim ( bday ‘(𝐴 |s 𝐵)) → (( bday ‘(𝐴 |s 𝐵)) = suc ( bday “ (𝐴𝐵)) → Lim suc ( bday “ (𝐴𝐵))))
1615adantl 481 . . . . 5 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → (( bday ‘(𝐴 |s 𝐵)) = suc ( bday “ (𝐴𝐵)) → Lim suc ( bday “ (𝐴𝐵))))
1713, 16mtod 198 . . . 4 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ¬ ( bday ‘(𝐴 |s 𝐵)) = suc ( bday “ (𝐴𝐵)))
1817neqned 2940 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ≠ suc ( bday “ (𝐴𝐵)))
19 bdayelon 27745 . . . . 5 ( bday ‘(𝐴 |s 𝐵)) ∈ On
2019onordi 6470 . . . 4 Ord ( bday ‘(𝐴 |s 𝐵))
21 imassrn 6063 . . . . . . 7 ( bday “ (𝐴𝐵)) ⊆ ran bday
22 bdayrn 27744 . . . . . . 7 ran bday = On
2321, 22sseqtri 4012 . . . . . 6 ( bday “ (𝐴𝐵)) ⊆ On
24 ssorduni 7778 . . . . . 6 (( bday “ (𝐴𝐵)) ⊆ On → Ord ( bday “ (𝐴𝐵)))
2523, 24ax-mp 5 . . . . 5 Ord ( bday “ (𝐴𝐵))
26 ordsuc 7812 . . . . 5 (Ord ( bday “ (𝐴𝐵)) ↔ Ord suc ( bday “ (𝐴𝐵)))
2725, 26mpbi 230 . . . 4 Ord suc ( bday “ (𝐴𝐵))
28 ordelssne 6384 . . . 4 ((Ord ( bday ‘(𝐴 |s 𝐵)) ∧ Ord suc ( bday “ (𝐴𝐵))) → (( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵)) ↔ (( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)) ∧ ( bday ‘(𝐴 |s 𝐵)) ≠ suc ( bday “ (𝐴𝐵)))))
2920, 27, 28mp2an 692 . . 3 (( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵)) ↔ (( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)) ∧ ( bday ‘(𝐴 |s 𝐵)) ≠ suc ( bday “ (𝐴𝐵))))
302, 18, 29sylanbrc 583 . 2 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵)))
3119a1i 11 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ∈ On)
32 ordsssuc 6448 . . 3 ((( bday ‘(𝐴 |s 𝐵)) ∈ On ∧ Ord ( bday “ (𝐴𝐵))) → (( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday “ (𝐴𝐵)) ↔ ( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵))))
3331, 25, 32sylancl 586 . 2 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → (( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday “ (𝐴𝐵)) ↔ ( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵))))
3430, 33mpbird 257 1 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday “ (𝐴𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wne 2933  Vcvv 3464  cun 3929  wss 3931   cuni 4888   class class class wbr 5124  ran crn 5660  cima 5662  Ord word 6356  Oncon0 6357  Lim wlim 6358  suc csuc 6359  Fun wfun 6530  cfv 6536  (class class class)co 7410   bday cbday 27610   <<s csslt 27749   |s cscut 27751
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-tp 4611  df-op 4613  df-uni 4889  df-int 4928  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1o 8485  df-2o 8486  df-no 27611  df-slt 27612  df-bday 27613  df-sslt 27750  df-scut 27752
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator