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

Theorem scutbdaybnd2lim 27798
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 27797 . . . 4 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
21adantr 480 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
3 bdayfun 27753 . . . . . . . . 9 Fun bday
4 ssltex1 27767 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐴 ∈ V)
5 ssltex2 27768 . . . . . . . . . 10 (𝐴 <<s 𝐵𝐵 ∈ V)
6 unexg 7745 . . . . . . . . . 10 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
74, 5, 6syl2anc 584 . . . . . . . . 9 (𝐴 <<s 𝐵 → (𝐴𝐵) ∈ V)
8 funimaexg 6633 . . . . . . . . 9 ((Fun bday ∧ (𝐴𝐵) ∈ V) → ( bday “ (𝐴𝐵)) ∈ V)
93, 7, 8sylancr 587 . . . . . . . 8 (𝐴 <<s 𝐵 → ( bday “ (𝐴𝐵)) ∈ V)
109uniexd 7744 . . . . . . 7 (𝐴 <<s 𝐵 ( bday “ (𝐴𝐵)) ∈ V)
1110adantr 480 . . . . . 6 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday “ (𝐴𝐵)) ∈ V)
12 nlimsucg 7845 . . . . . 6 ( ( bday “ (𝐴𝐵)) ∈ V → ¬ Lim suc ( bday “ (𝐴𝐵)))
1311, 12syl 17 . . . . 5 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ¬ Lim suc ( bday “ (𝐴𝐵)))
14 limeq 6375 . . . . . . 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 2938 . . 3 ((𝐴 <<s 𝐵 ∧ Lim ( bday ‘(𝐴 |s 𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ≠ suc ( bday “ (𝐴𝐵)))
19 bdayelon 27757 . . . . 5 ( bday ‘(𝐴 |s 𝐵)) ∈ On
2019onordi 6475 . . . 4 Ord ( bday ‘(𝐴 |s 𝐵))
21 imassrn 6069 . . . . . . 7 ( bday “ (𝐴𝐵)) ⊆ ran bday
22 bdayrn 27756 . . . . . . 7 ran bday = On
2321, 22sseqtri 4012 . . . . . 6 ( bday “ (𝐴𝐵)) ⊆ On
24 ssorduni 7781 . . . . . 6 (( bday “ (𝐴𝐵)) ⊆ On → Ord ( bday “ (𝐴𝐵)))
2523, 24ax-mp 5 . . . . 5 Ord ( bday “ (𝐴𝐵))
26 ordsuc 7815 . . . . 5 (Ord ( bday “ (𝐴𝐵)) ↔ Ord suc ( bday “ (𝐴𝐵)))
2725, 26mpbi 230 . . . 4 Ord suc ( bday “ (𝐴𝐵))
28 ordelssne 6390 . . . 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 6453 . . 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 1539  wcel 2107  wne 2931  Vcvv 3463  cun 3929  wss 3931   cuni 4887   class class class wbr 5123  ran crn 5666  cima 5668  Ord word 6362  Oncon0 6363  Lim wlim 6364  suc csuc 6365  Fun wfun 6535  cfv 6541  (class class class)co 7413   bday cbday 27622   <<s csslt 27761   |s cscut 27763
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5259  ax-sep 5276  ax-nul 5286  ax-pow 5345  ax-pr 5412  ax-un 7737
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3363  df-reu 3364  df-rab 3420  df-v 3465  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 4888  df-int 4927  df-br 5124  df-opab 5186  df-mpt 5206  df-tr 5240  df-id 5558  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-we 5619  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1o 8488  df-2o 8489  df-no 27623  df-slt 27624  df-bday 27625  df-sslt 27762  df-scut 27764
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator