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

Theorem cutsf 28183
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 28151 . . . 4 |s = (𝑎 ∈ 𝒫 No, 𝑏 ∈ ( <<s “ {𝑎}) ↦ (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
21mpofun 7544 . . 3 Fun |s
3 dmcuts 28182 . . 3 dom |s = <<s
4 df-fn 6541 . . 3 ( |s Fn <<s ↔ (Fun |s ∧ dom |s = <<s ))
52, 3, 4mpbir2an 724 . 2 |s Fn <<s
61rnmpo 7553 . . 3 ran |s = {𝑧 ∣ ∃𝑎 ∈ 𝒫 No∃𝑏 ∈ ( <<s “ {𝑎})𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))}
7 vex 3454 . . . . . . . . . 10 𝑎 ∈ V
8 vex 3454 . . . . . . . . . 10 𝑏 ∈ V
97, 8elimasn 6087 . . . . . . . . 9 (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
10 df-br 5103 . . . . . . . . 9 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
119, 10bitr4i 281 . . . . . . . 8 (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
12 cutsval 28171 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
13 cutscl 28173 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No)
1412, 13eqeltrrd 2861 . . . . . . . 8 (𝑎 <<s 𝑏 → (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No)
1511, 14sylbi 220 . . . . . . 7 (𝑏 ∈ ( <<s “ {𝑎}) → (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No)
16 eleq1a 2855 . . . . . . 7 ((℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No → (𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No))
1715, 16syl 18 . . . . . 6 (𝑏 ∈ ( <<s “ {𝑎}) → (𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No))
1817adantl 487 . . . . 5 ((𝑎 ∈ 𝒫 No ∧ 𝑏 ∈ ( <<s “ {𝑎})) → (𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No))
1918rexlimivv 3204 . . . 4 (∃𝑎 ∈ 𝒫 No∃𝑏 ∈ ( <<s “ {𝑎})𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No)
2019abssi 3993 . . 3 {𝑧 ∣ ∃𝑎 ∈ 𝒫 No∃𝑏 ∈ ( <<s “ {𝑎})𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} (bday‘𝑥) = ∩ (bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))} ⊆ No
216, 20eqsstri 3954 . 2 ran |s ⊆ No
22 df-f 6542 . 2 ( |s : <<s ⟶No ↔ ( |s Fn <<s ∧ ran |s ⊆ No))
235, 21, 22mpbir2an 724 1 |s : <<s ⟶No
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∃wrex 3086  {crab 3412   ⊆ wss 3895  𝒫 cpw 4556  {csn 4584  ⟨cop 4834  ∩ cint 4906   class class class wbr 5102  dom cdm 5650  ran crn 5651   “ cima 5653  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Nocsur 28002  bdaycbday 28004   <<s cslts 28148   |s ccuts 28150
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1o 8479  df-2o 8480  df-no 28005  df-lts 28006  df-bday 28007  df-slts 28149  df-cuts 28151
This theorem is used by:  madeval  28223  madeval2  28224  cutsfo  28296  madefi  28304
  Copyright terms: Public domain W3C validator