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

Theorem cutbday 27792
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 27788 . . 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 27789 . . . 4 (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
4 sneq 4592 . . . . . . . 8 (𝑥 = (𝐴 |s 𝐵) → {𝑥} = {(𝐴 |s 𝐵)})
54breq2d 5112 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → (𝐴 <<s {𝑥} ↔ 𝐴 <<s {(𝐴 |s 𝐵)}))
64breq1d 5110 . . . . . . 7 (𝑥 = (𝐴 |s 𝐵) → ({𝑥} <<s 𝐵 ↔ {(𝐴 |s 𝐵)} <<s 𝐵))
75, 6anbi12d 633 . . . . . 6 (𝑥 = (𝐴 |s 𝐵) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) ↔ (𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵)))
87elrab 3648 . . . . 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 27787 . . 3 (𝐴 <<s 𝐵 → ∃!𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))
13 fveqeq2 6851 . . . 4 (𝑦 = (𝐴 |s 𝐵) → (( bday 𝑦) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ ( bday ‘(𝐴 |s 𝐵)) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)})))
1413riota2 7350 . . 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 3350  {crab 3401  {csn 4582   cint 4904   class class class wbr 5100  cima 5635  cfv 6500  crio 7324  (class class class)co 7368   No csur 27619   bday cbday 27621   <<s cslts 27765   |s ccuts 27767
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1o 8407  df-2o 8408  df-no 27622  df-lts 27623  df-bday 27624  df-slts 27766  df-cuts 27768
This theorem is referenced by:  cutsun12  27798  cutbdaybnd  27803  cutbdaybnd2  27804  cutbdaylt  27806  bday0  27819  bday1  27822  sltsbday  27925  cofcut1  27928  cofcutr  27932  oniso  28279  bdayn0p1  28377
  Copyright terms: Public domain W3C validator