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

Theorem scutbdaybnd2 27876
Description: An upper bound on the birthday of a surreal cut. (Contributed by Scott Fenton, 10-Dec-2021.)
Assertion
Ref Expression
scutbdaybnd2 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))

Proof of Theorem scutbdaybnd2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 etasslt2 27874 . 2 (𝐴 <<s 𝐵 → ∃𝑥 No (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))
2 scutbday 27864 . . . . . 6 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
32adantr 480 . . . . 5 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
4 bdayfn 27833 . . . . . . 7 bday Fn No
5 ssrab2 4090 . . . . . . 7 {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ⊆ No
6 simprl 771 . . . . . . . 8 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → 𝑥 No )
7 simprr1 1220 . . . . . . . . 9 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → 𝐴 <<s {𝑥})
8 simprr2 1221 . . . . . . . . 9 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → {𝑥} <<s 𝐵)
97, 8jca 511 . . . . . . . 8 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))
10 sneq 4641 . . . . . . . . . . 11 (𝑦 = 𝑥 → {𝑦} = {𝑥})
1110breq2d 5160 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝐴 <<s {𝑦} ↔ 𝐴 <<s {𝑥}))
1210breq1d 5158 . . . . . . . . . 10 (𝑦 = 𝑥 → ({𝑦} <<s 𝐵 ↔ {𝑥} <<s 𝐵))
1311, 12anbi12d 632 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ↔ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)))
1413elrab 3695 . . . . . . . 8 (𝑥 ∈ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ↔ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)))
156, 9, 14sylanbrc 583 . . . . . . 7 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → 𝑥 ∈ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})
16 fnfvima 7253 . . . . . . 7 (( bday Fn No ∧ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ⊆ No 𝑥 ∈ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) → ( bday 𝑥) ∈ ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
174, 5, 15, 16mp3an12i 1464 . . . . . 6 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → ( bday 𝑥) ∈ ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
18 intss1 4968 . . . . . 6 (( bday 𝑥) ∈ ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) → ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ⊆ ( bday 𝑥))
1917, 18syl 17 . . . . 5 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ⊆ ( bday 𝑥))
203, 19eqsstrd 4034 . . . 4 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday 𝑥))
21 simprr3 1222 . . . 4 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵)))
2220, 21sstrd 4006 . . 3 ((𝐴 <<s 𝐵 ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
2322rexlimdvaa 3154 . 2 (𝐴 <<s 𝐵 → (∃𝑥 No (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ suc ( bday “ (𝐴𝐵))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵))))
241, 23mpd 15 1 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) ⊆ suc ( bday “ (𝐴𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  wrex 3068  {crab 3433  cun 3961  wss 3963  {csn 4631   cuni 4912   cint 4951   class class class wbr 5148  cima 5692  suc csuc 6388   Fn wfn 6558  cfv 6563  (class class class)co 7431   No csur 27699   bday cbday 27701   <<s csslt 27840   |s cscut 27842
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-tp 4636  df-op 4638  df-uni 4913  df-int 4952  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1o 8505  df-2o 8506  df-no 27702  df-slt 27703  df-bday 27704  df-sslt 27841  df-scut 27843
This theorem is referenced by:  scutbdaybnd2lim  27877  bday1s  27891
  Copyright terms: Public domain W3C validator