Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dmscut Structured version   Visualization version   GIF version

Theorem dmscut 32365
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 6941 . 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 32346 . . . 4 |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
3 df-mpt2 6849 . . . 4 (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))) = {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
42, 3eqtri 2787 . . 3 |s = {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
54dmeqi 5495 . 2 dom |s = dom {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
6 df-sslt 32344 . . . . 5 <<s = {⟨𝑎, 𝑏⟩ ∣ (𝑎 No 𝑏 No ∧ ∀𝑥𝑎𝑦𝑏 𝑥 <s 𝑦)}
76relopabi 5416 . . . 4 Rel <<s
8 19.42v 2048 . . . . . 6 (∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))) ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
9 ssltss1 32350 . . . . . . . . 9 (𝑎 <<s 𝑏𝑎 No )
10 vex 3353 . . . . . . . . . 10 𝑎 ∈ V
1110elpw 4323 . . . . . . . . 9 (𝑎 ∈ 𝒫 No 𝑎 No )
129, 11sylibr 225 . . . . . . . 8 (𝑎 <<s 𝑏𝑎 ∈ 𝒫 No )
1312pm4.71ri 556 . . . . . . 7 (𝑎 <<s 𝑏 ↔ (𝑎 ∈ 𝒫 No 𝑎 <<s 𝑏))
14 vex 3353 . . . . . . . . . 10 𝑏 ∈ V
1510, 14elimasn 5674 . . . . . . . . 9 (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
16 df-br 4812 . . . . . . . . 9 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
1715, 16bitr4i 269 . . . . . . . 8 (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
1817anbi2i 616 . . . . . . 7 ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ↔ (𝑎 ∈ 𝒫 No 𝑎 <<s 𝑏))
19 riotaex 6809 . . . . . . . . 9 (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ V
20 isset 3360 . . . . . . . . 9 ((𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ V ↔ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
2119, 20mpbi 221 . . . . . . . 8 𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))
2221biantru 525 . . . . . . 7 ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
2313, 18, 223bitr2i 290 . . . . . 6 (𝑎 <<s 𝑏 ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
248, 23, 163bitr2ri 291 . . . . 5 (⟨𝑎, 𝑏⟩ ∈ <<s ↔ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
2524a1i 11 . . . 4 (⊤ → (⟨𝑎, 𝑏⟩ ∈ <<s ↔ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))))
267, 25opabbi2dv 5442 . . 3 (⊤ → <<s = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))})
2726mptru 1660 . 2 <<s = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
281, 5, 273eqtr4i 2797 1 dom |s = <<s
Colors of variables: wff setvar class
Syntax hints:  wb 197  wa 384  w3a 1107   = wceq 1652  wtru 1653  wex 1874  wcel 2155  wral 3055  {crab 3059  Vcvv 3350  wss 3734  𝒫 cpw 4317  {csn 4336  cop 4342   cint 4635   class class class wbr 4811  {copab 4873  dom cdm 5279  cima 5282  cfv 6070  crio 6804  {coprab 6845  cmpt2 6846   No csur 32240   <s cslt 32241   bday cbday 32242   <<s csslt 32343   |s cscut 32345
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743  ax-sep 4943  ax-nul 4951  ax-pr 5064
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2063  df-mo 2565  df-eu 2582  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ral 3060  df-rex 3061  df-rab 3064  df-v 3352  df-sbc 3599  df-dif 3737  df-un 3739  df-in 3741  df-ss 3748  df-nul 4082  df-if 4246  df-pw 4319  df-sn 4337  df-pr 4339  df-op 4343  df-uni 4597  df-br 4812  df-opab 4874  df-xp 5285  df-rel 5286  df-cnv 5287  df-dm 5289  df-rn 5290  df-res 5291  df-ima 5292  df-iota 6033  df-riota 6805  df-oprab 6848  df-mpt2 6849  df-sslt 32344  df-scut 32346
This theorem is referenced by:  scutf  32366  madeval2  32383
  Copyright terms: Public domain W3C validator