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

Theorem cutbdaybnd2lim 27803
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
cutbdaybnd2lim ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday “ (𝐴𝐵)))

Proof of Theorem cutbdaybnd2lim
StepHypRef Expression
1 cutbdaybnd2 27802 . . . 4 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
21adantr 480 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
3 bdayfun 27754 . . . . . . . . 9 Fun bday
4 sltsex1 27769 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐴 ∈ V)
5 sltsex2 27770 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐵 ∈ V)
6 unexg 7690 . . . . . . . . . 10 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
74, 5, 6syl2anc 585 . . . . . . . . 9 (𝐴 <<s 𝐵 → (𝐴𝐵) ∈ V)
8 funimaexg 6579 . . . . . . . . 9 ((Fun bday ∧ (𝐴𝐵) ∈ V) → ( bday “ (𝐴𝐵)) ∈ V)
93, 7, 8sylancr 588 . . . . . . . 8 (𝐴 <<s 𝐵 → ( bday “ (𝐴𝐵)) ∈ V)
109uniexd 7689 . . . . . . 7 (𝐴 <<s 𝐵 ( bday “ (𝐴𝐵)) ∈ V)
1110adantr 480 . . . . . 6 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday “ (𝐴𝐵)) ∈ V)
12 nlimsucg 7786 . . . . . 6 ( ( bday “ (𝐴𝐵)) ∈ V → ¬ Lim suc ( bday “ (𝐴𝐵)))
1311, 12syl 17 . . . . 5 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ¬ Lim suc ( bday “ (𝐴𝐵)))
14 limeq 6329 . . . . . . 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 bdayon 27758 . . . . 5 ( bday ‘(𝐴 |s 𝐵)) ∈ On
2019onordi 6430 . . . 4 Ord ( bday ‘(𝐴 |s 𝐵))
21 imassrn 6030 . . . . . . 7 ( bday “ (𝐴𝐵)) ⊆ ran bday
22 bdayrn 27757 . . . . . . 7 ran bday = On
2321, 22sseqtri 3971 . . . . . 6 ( bday “ (𝐴𝐵)) ⊆ On
24 ssorduni 7726 . . . . . 6 (( bday “ (𝐴𝐵)) ⊆ On → Ord ( bday “ (𝐴𝐵)))
2523, 24ax-mp 5 . . . . 5 Ord ( bday “ (𝐴𝐵))
26 ordsuc 7758 . . . . 5 (Ord ( bday “ (𝐴𝐵)) ↔ Ord suc ( bday “ (𝐴𝐵)))
2725, 26mpbi 230 . . . 4 Ord suc ( bday “ (𝐴𝐵))
28 ordelssne 6344 . . . 4 ((Ord ( bday ‘(𝐴 |s 𝐵)) ∧ Ord suc ( bday “ (𝐴𝐵))) → (( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵)) ↔ (( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)) ∧ ( bday ‘(𝐴 |s 𝐵)) ≠ suc ( bday “ (𝐴𝐵)))))
2920, 27, 28mp2an 693 . . 3 (( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵)) ↔ (( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)) ∧ ( bday ‘(𝐴 |s 𝐵)) ≠ suc ( bday “ (𝐴𝐵))))
302, 18, 29sylanbrc 584 . 2 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵)))
3119a1i 11 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ∈ On)
32 ordsssuc 6408 . . 3 ((( bday ‘(𝐴 |s 𝐵)) ∈ On ∧ Ord ( bday “ (𝐴𝐵))) → (( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday “ (𝐴𝐵)) ↔ ( bday ‘(𝐴 |s 𝐵)) ∈ suc ( bday “ (𝐴𝐵))))
3331, 25, 32sylancl 587 . 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 1542  wcel 2114  wne 2933  Vcvv 3430  cun 3888  wss 3890   cuni 4851   class class class wbr 5086  ran crn 5625  cima 5627  Ord word 6316  Oncon0 6317  Lim wlim 6318  suc csuc 6319  Fun wfun 6486  cfv 6492  (class class class)co 7360   bday cbday 27619   <<s cslts 27763   |s ccuts 27765
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 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1o 8398  df-2o 8399  df-no 27620  df-lts 27621  df-bday 27622  df-slts 27764  df-cuts 27766
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator