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

Theorem dmscut 27172
Description: The domain of the surreal cut operation is all separated surreal sets. (Contributed by Scott Fenton, 8-Dec-2021.)
Assertion
Ref Expression
dmscut dom |s = <<s

Proof of Theorem dmscut
Dummy variables 𝑎 𝑏 𝑐 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmoprab 7463 . 2 dom {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))} = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
2 df-scut 27145 . . . 4 |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
3 df-mpo 7367 . . . 4 (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))) = {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
42, 3eqtri 2765 . . 3 |s = {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
54dmeqi 5865 . 2 dom |s = dom {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
6 df-sslt 27143 . . . . 5 <<s = {⟨𝑎, 𝑏⟩ ∣ (𝑎 No 𝑏 No ∧ ∀𝑥𝑎𝑦𝑏 𝑥 <s 𝑦)}
76relopabiv 5781 . . . 4 Rel <<s
8 19.42v 1958 . . . . . 6 (∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))) ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
9 ssltss1 27150 . . . . . . . . 9 (𝑎 <<s 𝑏𝑎 No )
10 velpw 4570 . . . . . . . . 9 (𝑎 ∈ 𝒫 No 𝑎 No )
119, 10sylibr 233 . . . . . . . 8 (𝑎 <<s 𝑏𝑎 ∈ 𝒫 No )
1211pm4.71ri 562 . . . . . . 7 (𝑎 <<s 𝑏 ↔ (𝑎 ∈ 𝒫 No 𝑎 <<s 𝑏))
13 vex 3452 . . . . . . . . . 10 𝑎 ∈ V
14 vex 3452 . . . . . . . . . 10 𝑏 ∈ V
1513, 14elimasn 6046 . . . . . . . . 9 (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
16 df-br 5111 . . . . . . . . 9 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
1715, 16bitr4i 278 . . . . . . . 8 (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
1817anbi2i 624 . . . . . . 7 ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ↔ (𝑎 ∈ 𝒫 No 𝑎 <<s 𝑏))
19 riotaex 7322 . . . . . . . . 9 (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ V
2019isseti 3463 . . . . . . . 8 𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))
2120biantru 531 . . . . . . 7 ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
2212, 18, 213bitr2i 299 . . . . . 6 (𝑎 <<s 𝑏 ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
238, 22, 163bitr2ri 300 . . . . 5 (⟨𝑎, 𝑏⟩ ∈ <<s ↔ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
2423a1i 11 . . . 4 (⊤ → (⟨𝑎, 𝑏⟩ ∈ <<s ↔ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))))
257, 24opabbi2dv 5810 . . 3 (⊤ → <<s = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))})
2625mptru 1549 . 2 <<s = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
271, 5, 263eqtr4i 2775 1 dom |s = <<s
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 397  w3a 1088   = wceq 1542  wtru 1543  wex 1782  wcel 2107  wral 3065  {crab 3410  wss 3915  𝒫 cpw 4565  {csn 4591  cop 4597   cint 4912   class class class wbr 5110  {copab 5172  dom cdm 5638  cima 5641  cfv 6501  crio 7317  {coprab 7363  cmpo 7364   No csur 27004   <s cslt 27005   bday cbday 27006   <<s csslt 27142   |s cscut 27144
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2708  ax-sep 5261  ax-nul 5268  ax-pr 5389
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2890  df-ne 2945  df-ral 3066  df-rex 3075  df-rab 3411  df-v 3450  df-dif 3918  df-un 3920  df-in 3922  df-ss 3932  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-xp 5644  df-rel 5645  df-cnv 5646  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6453  df-riota 7318  df-oprab 7366  df-mpo 7367  df-sslt 27143  df-scut 27145
This theorem is referenced by:  scutf  27173  madeval2  27205
  Copyright terms: Public domain W3C validator