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

Theorem scutf 27759
Description: Functionality statement for the surreal cut operator. (Contributed by Scott Fenton, 15-Dec-2021.)
Assertion
Ref Expression
scutf |s : <<s ⟶ No

Proof of Theorem scutf
Dummy variables 𝑎 𝑏 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-scut 27729 . . . 4 |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
21mpofun 7476 . . 3 Fun |s
3 dmscut 27758 . . 3 dom |s = <<s
4 df-fn 6490 . . 3 ( |s Fn <<s ↔ (Fun |s ∧ dom |s = <<s ))
52, 3, 4mpbir2an 711 . 2 |s Fn <<s
61rnmpo 7485 . . 3 ran |s = {𝑧 ∣ ∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))}
7 vex 3440 . . . . . . . . . 10 𝑎 ∈ V
8 vex 3440 . . . . . . . . . 10 𝑏 ∈ V
97, 8elimasn 6044 . . . . . . . . 9 (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
10 df-br 5094 . . . . . . . . 9 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
119, 10bitr4i 278 . . . . . . . 8 (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
12 scutval 27747 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
13 scutcl 27749 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No )
1412, 13eqeltrrd 2832 . . . . . . . 8 (𝑎 <<s 𝑏 → (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No )
1511, 14sylbi 217 . . . . . . 7 (𝑏 ∈ ( <<s “ {𝑎}) → (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No )
16 eleq1a 2826 . . . . . . 7 ((𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No → (𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 No ))
1715, 16syl 17 . . . . . 6 (𝑏 ∈ ( <<s “ {𝑎}) → (𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 No ))
1817adantl 481 . . . . 5 ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) → (𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 No ))
1918rexlimivv 3174 . . . 4 (∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 No )
2019abssi 4016 . . 3 {𝑧 ∣ ∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))} ⊆ No
216, 20eqsstri 3976 . 2 ran |s ⊆ No
22 df-f 6491 . 2 ( |s : <<s ⟶ No ↔ ( |s Fn <<s ∧ ran |s ⊆ No ))
235, 21, 22mpbir2an 711 1 |s : <<s ⟶ No
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  {cab 2709  wrex 3056  {crab 3395  wss 3897  𝒫 cpw 4549  {csn 4575  cop 4581   cint 4897   class class class wbr 5093  dom cdm 5619  ran crn 5620  cima 5622  Fun wfun 6481   Fn wfn 6482  wf 6483  cfv 6487  crio 7308  (class class class)co 7352   No csur 27584   bday cbday 27586   <<s csslt 27726   |s cscut 27728
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-tp 4580  df-op 4582  df-uni 4859  df-int 4898  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-ord 6315  df-on 6316  df-suc 6318  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-1o 8391  df-2o 8392  df-no 27587  df-slt 27588  df-bday 27589  df-sslt 27727  df-scut 27729
This theorem is referenced by:  madeval  27799  madeval2  27800  scutfo  27856  madefi  27864
  Copyright terms: Public domain W3C validator