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

Theorem cutbday 27780
Description: The birthday of the surreal cut is equal to the minimum birthday in the gap. (Contributed by Scott Fenton, 8-Dec-2021.)
Assertion
Ref Expression
cutbday (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem cutbday
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cutsval 27776 . . 3 (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) = (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})))
21eqcomd 2742 . 2 (𝐴 <<s 𝐵 → (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})) = (𝐴 |s 𝐵))
3 cutcuts 27777 . . . 4 (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
4 sneq 4590 . . . . . . . 8 (𝑥 = (𝐴 |s 𝐵) → {𝑥} = {(𝐴 |s 𝐵)})
54breq2d 5110 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → (𝐴 <<s {𝑥} ↔ 𝐴 <<s {(𝐴 |s 𝐵)}))
64breq1d 5108 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → ({𝑥} <<s 𝐵 ↔ {(𝐴 |s 𝐵)} <<s 𝐵))
75, 6anbi12d 632 . . . . . 6 (𝑥 = (𝐴 |s 𝐵) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) ↔ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
87elrab 3646 . . . . 5 ((𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ↔ ((𝐴 |s 𝐵) ∈ No ∧ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
9 3anass 1094 . . . . 5 (((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵) ↔ ((𝐴 |s 𝐵) ∈ No ∧ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
108, 9bitr4i 278 . . . 4 ((𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ↔ ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
113, 10sylibr 234 . . 3 (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})
12 conway 27775 . . 3 (𝐴 <<s 𝐵 → ∃!𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))
13 fveqeq2 6843 . . . 4 (𝑦 = (𝐴 |s 𝐵) → (( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})))
1413riota2 7340 . . 3 (((𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ∧ ∃!𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})) → (( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})) = (𝐴 |s 𝐵)))
1511, 12, 14syl2anc 584 . 2 (𝐴 <<s 𝐵 → (( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})) = (𝐴 |s 𝐵)))
162, 15mpbird 257 1 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  ∃!wreu 3348  {crab 3399  {csn 4580   cint 4902   class class class wbr 5098  cima 5627  cfv 6492  crio 7314  (class class class)co 7358   No csur 27607   bday cbday 27609   <<s cslts 27753   |s ccuts 27755
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  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 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-uni 4864  df-int 4903  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  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-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 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1o 8397  df-2o 8398  df-no 27610  df-lts 27611  df-bday 27612  df-slts 27754  df-cuts 27756
This theorem is referenced by:  cutsun12  27786  cutbdaybnd  27791  cutbdaybnd2  27792  cutbdaylt  27794  bday0  27807  bday1  27810  sltsbday  27913  cofcut1  27916  cofcutr  27920  oniso  28267  bdayn0p1  28365
  Copyright terms: Public domain W3C validator