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

Theorem cutbday 27801
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 27797 . . 3 (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) = (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})))
21eqcomd 2746 . 2 (𝐴 <<s 𝐵 → (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})) = (𝐴 |s 𝐵))
3 cutcuts 27798 . . . 4 (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
4 sneq 4572 . . . . . . . 8 (𝑥 = (𝐴 |s 𝐵) → {𝑥} = {(𝐴 |s 𝐵)})
54breq2d 5091 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → (𝐴 <<s {𝑥} ↔ 𝐴 <<s {(𝐴 |s 𝐵)}))
64breq1d 5089 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → ({𝑥} <<s 𝐵 ↔ {(𝐴 |s 𝐵)} <<s 𝐵))
75, 6anbi12d 638 . . . . . 6 (𝑥 = (𝐴 |s 𝐵) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) ↔ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
87elrab 3636 . . . . 5 ((𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ↔ ((𝐴 |s 𝐵) ∈ No ∧ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
9 3anass 1100 . . . . 5 (((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵) ↔ ((𝐴 |s 𝐵) ∈ No ∧ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
108, 9bitr4i 279 . . . 4 ((𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ↔ ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
113, 10sylibr 235 . . 3 (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})
12 conway 27796 . . 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 7345 . . 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 590 . 2 (𝐴 <<s 𝐵 → (( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ (𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})) = (𝐴 |s 𝐵)))
162, 15mpbird 258 1 (𝐴 <<s 𝐵 → ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  ∃!wreu 3343  {crab 3392  {csn 4562   cint 4884   class class class wbr 5079  cima 5628  cfv 6492  crio 7319  (class class class)co 7363   No csur 27628   bday cbday 27630   <<s cslts 27774   |s ccuts 27776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  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 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1o 8402  df-2o 8403  df-no 27631  df-lts 27632  df-bday 27633  df-slts 27775  df-cuts 27777
This theorem is referenced by:  cutsun12  27807  cutbdaybnd  27812  cutbdaybnd2  27813  cutbdaylt  27815  bday0  27828  bday1  27831  sltsbday  27934  cofcut1  27937  cofcutr  27941  oniso  28288  bdayn0p1  28386
  Copyright terms: Public domain W3C validator