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

Theorem cutsval 28172
Description: The value of the surreal cut operation. (Contributed by Scott Fenton, 8-Dec-2021.)
Assertion
Ref Expression
cutsval (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem cutsval
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sltsex1 28155 . . 3 (𝐴 <<s 𝐵 → 𝐴 ∈ V)
2 sltsss1 28157 . . 3 (𝐴 <<s 𝐵 → 𝐴 ⊆ No)
31, 2elpwd 4562 . 2 (𝐴 <<s 𝐵 → 𝐴 ∈ 𝒫 No)
4 df-br 5103 . . . 4 (𝐴 <<s 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ <<s )
54biimpi 219 . . 3 (𝐴 <<s 𝐵 → ⟨𝐴, 𝐵⟩ ∈ <<s )
6 sltsex2 28156 . . . 4 (𝐴 <<s 𝐵 → 𝐵 ∈ V)
7 elimasng 6086 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐵 ∈ ( <<s “ {𝐴}) ↔ ⟨𝐴, 𝐵⟩ ∈ <<s ))
81, 6, 7syl2anc 596 . . 3 (𝐴 <<s 𝐵 → (𝐵 ∈ ( <<s “ {𝐴}) ↔ ⟨𝐴, 𝐵⟩ ∈ <<s ))
95, 8mpbird 260 . 2 (𝐴 <<s 𝐵 → 𝐵 ∈ ( <<s “ {𝐴}))
10 riotaex 7382 . . 3 (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})) ∈ V
11 breq1 5105 . . . . . . 7 (𝑎 = 𝐴 → (𝑎 <<s {𝑦} ↔ 𝐴 <<s {𝑦}))
12 breq2 5106 . . . . . . 7 (𝑏 = 𝐵 → ({𝑦} <<s 𝑏 ↔ {𝑦} <<s 𝐵))
1311, 12bi2anan9 650 . . . . . 6 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏) ↔ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)))
1413rabbidv 3419 . . . . 5 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} = {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})
1514imaeq2d 6051 . . . . . . 7 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}) = (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
1615inteqd 4911 . . . . . 6 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
1716eqeq2d 2771 . . . . 5 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}) ↔ (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
1814, 17riotaeqbidv 7381 . . . 4 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
19 sneq 4590 . . . . 5 (𝑎 = 𝐴 → {𝑎} = {𝐴})
2019imaeq2d 6051 . . . 4 (𝑎 = 𝐴 → ( <<s “ {𝑎}) = ( <<s “ {𝐴}))
21 df-cuts 28152 . . . 4 |s = (𝑎 ∈ 𝒫 No, 𝑏 ∈ ( <<s “ {𝑎}) ↦ (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
2218, 20, 21ovmpox 7574 . . 3 ((𝐴 ∈ 𝒫 No ∧ 𝐵 ∈ ( <<s “ {𝐴}) ∧ (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})) ∈ V) → (𝐴 |s 𝐵) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
2310, 22mp3an3 1479 . 2 ((𝐴 ∈ 𝒫 No ∧ 𝐵 ∈ ( <<s “ {𝐴})) → (𝐴 |s 𝐵) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
243, 9, 23syl2anc 596 1 (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450  𝒫 cpw 4556  {csn 4584  ⟨cop 4834  ∩ cint 4906   class class class wbr 5102   “ cima 5653  ‘cfv 6539  ℩crio 7377  (class class class)co 7421  Nocsur 28003  bdaycbday 28005   <<s cslts 28149   |s ccuts 28151
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-slts 28150  df-cuts 28152
This theorem is used by:  cutcuts  28173  cutbday  28176  eqcuts  28177  cutsun12  28182  cutsf  28184  cutbdaylt  28190
  Copyright terms: Public domain W3C validator