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

Theorem cutbday 27790
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 27786 . . 3 (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) = (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})))
21eqcomd 2743 . 2 (𝐴 <<s 𝐵 → (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})) = (𝐴 |s 𝐵))
3 cutcuts 27787 . . . 4 (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
4 sneq 4578 . . . . . . . 8 (𝑥 = (𝐴 |s 𝐵) → {𝑥} = {(𝐴 |s 𝐵)})
54breq2d 5098 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → (𝐴 <<s {𝑥} ↔ 𝐴 <<s {(𝐴 |s 𝐵)}))
64breq1d 5096 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → ({𝑥} <<s 𝐵 ↔ {(𝐴 |s 𝐵)} <<s 𝐵))
75, 6anbi12d 633 . . . . . 6 (𝑥 = (𝐴 |s 𝐵) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) ↔ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
87elrab 3635 . . . . 5 ((𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ↔ ((𝐴 |s 𝐵) ∈ No ∧ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
9 3anass 1095 . . . . 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 27785 . . 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 7342 . . 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 585 . 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 1087   = wceq 1542  wcel 2114  ∃!wreu 3341  {crab 3390  {csn 4568   cint 4890   class class class wbr 5086  cima 5627  cfv 6492  crio 7316  (class class class)co 7360   No csur 27617   bday cbday 27619   <<s cslts 27763   |s ccuts 27765
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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  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 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1o 8398  df-2o 8399  df-no 27620  df-lts 27621  df-bday 27622  df-slts 27764  df-cuts 27766
This theorem is referenced by:  cutsun12  27796  cutbdaybnd  27801  cutbdaybnd2  27802  cutbdaylt  27804  bday0  27817  bday1  27820  sltsbday  27923  cofcut1  27926  cofcutr  27930  oniso  28277  bdayn0p1  28375
  Copyright terms: Public domain W3C validator