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

Theorem cutsval 28148
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 28131 . . 3 (𝐴 <<s 𝐵 → 𝐴 ∈ V)
2 sltsss1 28133 . . 3 (𝐴 <<s 𝐵 → 𝐴 ⊆ No )
31, 2elpwd 4563 . 2 (𝐴 <<s 𝐵 → 𝐴 ∈ 𝒫 No )
4 df-br 5104 . . . 4 (𝐴 <<s 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ <<s )
54biimpi 219 . . 3 (𝐴 <<s 𝐵 → ⟨𝐴, 𝐵⟩ ∈ <<s )
6 sltsex2 28132 . . . 4 (𝐴 <<s 𝐵 → 𝐵 ∈ V)
7 elimasng 6083 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐵 ∈ ( <<s “ {𝐴}) ↔ ⟨𝐴, 𝐵⟩ ∈ <<s ))
81, 6, 7syl2anc 596 . . 3 (𝐴 <<s 𝐵 → (𝐵 ∈ ( <<s “ {𝐴}) ↔ ⟨𝐴, 𝐵⟩ ∈ <<s ))
95, 8mpbird 260 . 2 (𝐴 <<s 𝐵 → 𝐵 ∈ ( <<s “ {𝐴}))
10 riotaex 7373 . . 3 (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})) ∈ V
11 breq1 5106 . . . . . . 7 (𝑎 = 𝐴 → (𝑎 <<s {𝑦} ↔ 𝐴 <<s {𝑦}))
12 breq2 5107 . . . . . . 7 (𝑏 = 𝐵 → ({𝑦} <<s 𝑏 ↔ {𝑦} <<s 𝐵))
1311, 12bi2anan9 650 . . . . . 6 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏) ↔ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)))
1413rabbidv 3420 . . . . 5 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} = {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})
1514imaeq2d 6054 . . . . . . 7 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}) = ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
1615inteqd 4912 . . . . . 6 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
1716eqeq2d 2772 . . . . 5 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}) ↔ ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
1814, 17riotaeqbidv 7372 . . . 4 ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})))
19 sneq 4594 . . . . 5 (𝑎 = 𝐴 → {𝑎} = {𝐴})
2019imaeq2d 6054 . . . 4 (𝑎 = 𝐴 → ( <<s “ {𝑎}) = ( <<s “ {𝐴}))
21 df-cuts 28128 . . . 4 |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
2218, 20, 21ovmpox 7565 . . 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 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451  𝒫 cpw 4557  {csn 4584  ⟨cop 4590  ∩ cint 4907   class class class wbr 5103   “ cima 5654  ‘cfv 6531  ℩crio 7368  (class class class)co 7412   No csur 27979   bday cbday 27981   <<s cslts 28125   |s ccuts 28127
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-slts 28126  df-cuts 28128
This theorem is used by:  cutcuts  28149  cutbday  28152  eqcuts  28153  cutsun12  28158  cutsf  28160  cutbdaylt  28166
  Copyright terms: Public domain W3C validator