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 32043
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 6783 . 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 32024 . . . 4 |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
3 df-mpt2 6695 . . . 4 (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))) = {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
42, 3eqtri 2673 . . 3 |s = {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
54dmeqi 5357 . 2 dom |s = dom {⟨⟨𝑎, 𝑏⟩, 𝑐⟩ ∣ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
6 df-sslt 32022 . . . . 5 <<s = {⟨𝑎, 𝑏⟩ ∣ (𝑎 No 𝑏 No ∧ ∀𝑥𝑎𝑦𝑏 𝑥 <s 𝑦)}
76relopabi 5278 . . . 4 Rel <<s
8 19.42v 1921 . . . . . 6 (∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))) ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
9 ssltss1 32028 . . . . . . . . 9 (𝑎 <<s 𝑏𝑎 No )
10 vex 3234 . . . . . . . . . 10 𝑎 ∈ V
1110elpw 4197 . . . . . . . . 9 (𝑎 ∈ 𝒫 No 𝑎 No )
129, 11sylibr 224 . . . . . . . 8 (𝑎 <<s 𝑏𝑎 ∈ 𝒫 No )
1312pm4.71ri 666 . . . . . . 7 (𝑎 <<s 𝑏 ↔ (𝑎 ∈ 𝒫 No 𝑎 <<s 𝑏))
14 vex 3234 . . . . . . . . . 10 𝑏 ∈ V
1510, 14elimasn 5525 . . . . . . . . 9 (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
16 df-br 4686 . . . . . . . . 9 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
1715, 16bitr4i 267 . . . . . . . 8 (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
1817anbi2i 730 . . . . . . 7 ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ↔ (𝑎 ∈ 𝒫 No 𝑎 <<s 𝑏))
19 riotaex 6655 . . . . . . . . 9 (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ V
20 isset 3238 . . . . . . . . 9 ((𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ V ↔ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
2119, 20mpbi 220 . . . . . . . 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 288 . . . . . 6 (𝑎 <<s 𝑏 ↔ ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ ∃𝑐 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))))
248, 23, 163bitr2ri 289 . . . . 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 5304 . . 3 (⊤ → <<s = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))})
2726trud 1533 . 2 <<s = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) ∧ 𝑐 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))}
281, 5, 273eqtr4i 2683 1 dom |s = <<s
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 383  w3a 1054   = wceq 1523  wtru 1524  wex 1744  wcel 2030  wral 2941  {crab 2945  Vcvv 3231  wss 3607  𝒫 cpw 4191  {csn 4210  cop 4216   cint 4507   class class class wbr 4685  {copab 4745  dom cdm 5143  cima 5146  cfv 5926  crio 6650  {coprab 6691  cmpt2 6692   No csur 31918   <s cslt 31919   bday cbday 31920   <<s csslt 32021   |s cscut 32023
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-xp 5149  df-rel 5150  df-cnv 5151  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-riota 6651  df-oprab 6694  df-mpt2 6695  df-sslt 32022  df-scut 32024
This theorem is referenced by:  scutf  32044  madeval2  32061
  Copyright terms: Public domain W3C validator