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

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

Proof of Theorem cutsf
Dummy variables 𝑎 𝑏 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-cuts 27777 . . . 4 |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
21mpofun 7487 . . 3 Fun |s
3 dmcuts 27808 . . 3 dom |s = <<s
4 df-fn 6495 . . 3 ( |s Fn <<s ↔ (Fun |s ∧ dom |s = <<s ))
52, 3, 4mpbir2an 717 . 2 |s Fn <<s
61rnmpo 7496 . . 3 ran |s = {𝑧 ∣ ∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))}
7 vex 3436 . . . . . . . . . 10 𝑎 ∈ V
8 vex 3436 . . . . . . . . . 10 𝑏 ∈ V
97, 8elimasn 6049 . . . . . . . . 9 (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
10 df-br 5080 . . . . . . . . 9 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
119, 10bitr4i 279 . . . . . . . 8 (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
12 cutsval 27797 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
13 cutscl 27799 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No )
1412, 13eqeltrrd 2841 . . . . . . . 8 (𝑎 <<s 𝑏 → (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No )
1511, 14sylbi 218 . . . . . . 7 (𝑏 ∈ ( <<s “ {𝑎}) → (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No )
16 eleq1a 2835 . . . . . . 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 482 . . . . 5 ((𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})) → (𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 No ))
1918rexlimivv 3182 . . . 4 (∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 No )
2019abssi 4006 . . 3 {𝑧 ∣ ∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))} ⊆ No
216, 20eqsstri 3968 . 2 ran |s ⊆ No
22 df-f 6496 . 2 ( |s : <<s ⟶ No ↔ ( |s Fn <<s ∧ ran |s ⊆ No ))
235, 21, 22mpbir2an 717 1 |s : <<s ⟶ No
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  {cab 2718  wrex 3064  {crab 3392  wss 3890  𝒫 cpw 4536  {csn 4562  cop 4568   cint 4884   class class class wbr 5079  dom cdm 5625  ran crn 5626  cima 5628  Fun wfun 6486   Fn wfn 6487  wf 6488  cfv 6492  crio 7319  (class class class)co 7363   No csur 27628   bday cbday 27630   <<s cslts 27774   |s ccuts 27776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1o 8402  df-2o 8403  df-no 27631  df-lts 27632  df-bday 27633  df-slts 27775  df-cuts 27777
This theorem is referenced by:  madeval  27849  madeval2  27850  cutsfo  27922  madefi  27930
  Copyright terms: Public domain W3C validator