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

Theorem scutbdaybnd 27766
Description: An upper bound on the birthday of a surreal cut. (Contributed by Scott Fenton, 10-Aug-2024.)
Assertion
Ref Expression
scutbdaybnd ((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) → ( bday ‘(𝐴 |s 𝐵)) ⊆ 𝑂)

Proof of Theorem scutbdaybnd
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 etasslt 27764 . 2 ((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) → ∃𝑥 No (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))
2 simpl1 1188 . . . . 5 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → 𝐴 <<s 𝐵)
3 scutbday 27755 . . . . 5 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
42, 3syl 17 . . . 4 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
5 bdayfn 27724 . . . . . 6 bday Fn No
6 ssrab2 4075 . . . . . 6 {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ⊆ No
7 sneq 4640 . . . . . . . . 9 (𝑦 = 𝑥 → {𝑦} = {𝑥})
87breq2d 5162 . . . . . . . 8 (𝑦 = 𝑥 → (𝐴 <<s {𝑦} ↔ 𝐴 <<s {𝑥}))
97breq1d 5160 . . . . . . . 8 (𝑦 = 𝑥 → ({𝑦} <<s 𝐵 ↔ {𝑥} <<s 𝐵))
108, 9anbi12d 630 . . . . . . 7 (𝑦 = 𝑥 → ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ↔ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)))
11 simprl 769 . . . . . . 7 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → 𝑥 No )
12 simprr1 1218 . . . . . . . 8 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → 𝐴 <<s {𝑥})
13 simprr2 1219 . . . . . . . 8 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → {𝑥} <<s 𝐵)
1412, 13jca 510 . . . . . . 7 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))
1510, 11, 14elrabd 3684 . . . . . 6 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → 𝑥 ∈ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})
16 fnfvima 7249 . . . . . 6 (( bday Fn No ∧ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ⊆ No 𝑥 ∈ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) → ( bday 𝑥) ∈ ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
175, 6, 15, 16mp3an12i 1461 . . . . 5 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → ( bday 𝑥) ∈ ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
18 intss1 4968 . . . . 5 (( bday 𝑥) ∈ ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) → ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ⊆ ( bday 𝑥))
1917, 18syl 17 . . . 4 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → ( bday “ {𝑦 No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ⊆ ( bday 𝑥))
204, 19eqsstrd 4018 . . 3 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ ( bday 𝑥))
21 simprr3 1220 . . 3 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → ( bday 𝑥) ⊆ 𝑂)
2220, 21sstrd 3990 . 2 (((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) ∧ (𝑥 No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ ( bday 𝑥) ⊆ 𝑂))) → ( bday ‘(𝐴 |s 𝐵)) ⊆ 𝑂)
231, 22rexlimddv 3157 1 ((𝐴 <<s 𝐵𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂) → ( bday ‘(𝐴 |s 𝐵)) ⊆ 𝑂)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394  w3a 1084   = wceq 1533  wcel 2098  {crab 3428  cun 3945  wss 3947  {csn 4630   cint 4951   class class class wbr 5150  cima 5683  Oncon0 6372   Fn wfn 6546  cfv 6551  (class class class)co 7424   No csur 27591   bday cbday 27593   <<s csslt 27731   |s cscut 27733
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2698  ax-rep 5287  ax-sep 5301  ax-nul 5308  ax-pr 5431  ax-un 7744
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2937  df-ral 3058  df-rex 3067  df-rmo 3372  df-reu 3373  df-rab 3429  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4325  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-tp 4635  df-op 4637  df-uni 4911  df-int 4952  df-iun 5000  df-br 5151  df-opab 5213  df-mpt 5234  df-tr 5268  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5635  df-we 5637  df-xp 5686  df-rel 5687  df-cnv 5688  df-co 5689  df-dm 5690  df-rn 5691  df-res 5692  df-ima 5693  df-ord 6375  df-on 6376  df-suc 6378  df-iota 6503  df-fun 6553  df-fn 6554  df-f 6555  df-f1 6556  df-fo 6557  df-f1o 6558  df-fv 6559  df-riota 7380  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1o 8491  df-2o 8492  df-no 27594  df-slt 27595  df-bday 27596  df-sslt 27732  df-scut 27734
This theorem is referenced by:  madebdayim  27832  negsbdaylem  27986  n0sbday  28235
  Copyright terms: Public domain W3C validator