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

Theorem cutbdaybnd2lim 27789
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 27788 . . . 4 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
21adantr 480 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
3 bdayfun 27740 . . . . . . . . 9 Fun bday
4 sltsex1 27755 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐴 ∈ V)
5 sltsex2 27756 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐵 ∈ V)
6 unexg 7697 . . . . . . . . . 10 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
74, 5, 6syl2anc 585 . . . . . . . . 9 (𝐴 <<s 𝐵 → (𝐴𝐵) ∈ V)
8 funimaexg 6585 . . . . . . . . 9 ((Fun bday ∧ (𝐴𝐵) ∈ V) → ( bday “ (𝐴𝐵)) ∈ V)
93, 7, 8sylancr 588 . . . . . . . 8 (𝐴 <<s 𝐵 → ( bday “ (𝐴𝐵)) ∈ V)
109uniexd 7696 . . . . . . 7 (𝐴 <<s 𝐵 ( bday “ (𝐴𝐵)) ∈ V)
1110adantr 480 . . . . . 6 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday “ (𝐴𝐵)) ∈ V)
12 nlimsucg 7793 . . . . . 6 ( ( bday “ (𝐴𝐵)) ∈ V → ¬ Lim suc ( bday “ (𝐴𝐵)))
1311, 12syl 17 . . . . 5 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ¬ Lim suc ( bday “ (𝐴𝐵)))
14 limeq 6335 . . . . . . 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 2939 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ≠ suc ( bday “ (𝐴𝐵)))
19 bdayon 27744 . . . . 5 ( bday ‘(𝐴 |s 𝐵)) ∈ On
2019onordi 6436 . . . 4 Ord ( bday ‘(𝐴 |s 𝐵))
21 imassrn 6036 . . . . . . 7 ( bday “ (𝐴𝐵)) ⊆ ran bday
22 bdayrn 27743 . . . . . . 7 ran bday = On
2321, 22sseqtri 3970 . . . . . 6 ( bday “ (𝐴𝐵)) ⊆ On
24 ssorduni 7733 . . . . . 6 (( bday “ (𝐴𝐵)) ⊆ On → Ord ( bday “ (𝐴𝐵)))
2523, 24ax-mp 5 . . . . 5 Ord ( bday “ (𝐴𝐵))
26 ordsuc 7765 . . . . 5 (Ord ( bday “ (𝐴𝐵)) ↔ Ord suc ( bday “ (𝐴𝐵)))
2725, 26mpbi 230 . . . 4 Ord suc ( bday “ (𝐴𝐵))
28 ordelssne 6350 . . . 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 6414 . . 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 2932  Vcvv 3429  cun 3887  wss 3889   cuni 4850   class class class wbr 5085  ran crn 5632  cima 5634  Ord word 6322  Oncon0 6323  Lim wlim 6324  suc csuc 6325  Fun wfun 6492  cfv 6498  (class class class)co 7367   bday cbday 27605   <<s cslts 27749   |s ccuts 27751
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-int 4890  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1o 8405  df-2o 8406  df-no 27606  df-lts 27607  df-bday 27608  df-slts 27750  df-cuts 27752
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator