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

Theorem scutf 27746
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 27716 . . . 4 |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
21mpofun 7465 . . 3 Fun |s
3 dmscut 27745 . . 3 dom |s = <<s
4 df-fn 6480 . . 3 ( |s Fn <<s ↔ (Fun |s ∧ dom |s = <<s ))
52, 3, 4mpbir2an 711 . 2 |s Fn <<s
61rnmpo 7474 . . 3 ran |s = {𝑧 ∣ ∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))}
7 vex 3438 . . . . . . . . . 10 𝑎 ∈ V
8 vex 3438 . . . . . . . . . 10 𝑏 ∈ V
97, 8elimasn 6036 . . . . . . . . 9 (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
10 df-br 5090 . . . . . . . . 9 (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
119, 10bitr4i 278 . . . . . . . 8 (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
12 scutval 27734 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
13 scutcl 27736 . . . . . . . . 9 (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No )
1412, 13eqeltrrd 2830 . . . . . . . 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 2824 . . . . . . 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 3172 . . . 4 (∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 No )
2019abssi 4018 . . 3 {𝑧 ∣ ∃𝑎 ∈ 𝒫 No 𝑏 ∈ ( <<s “ {𝑎})𝑧 = (𝑥 ∈ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))} ⊆ No
216, 20eqsstri 3979 . 2 ran |s ⊆ No
22 df-f 6481 . 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 2110  {cab 2708  wrex 3054  {crab 3393  wss 3900  𝒫 cpw 4548  {csn 4574  cop 4580   cint 4895   class class class wbr 5089  dom cdm 5614  ran crn 5615  cima 5617  Fun wfun 6471   Fn wfn 6472  wf 6473  cfv 6477  crio 7297  (class class class)co 7341   No csur 27571   bday cbday 27573   <<s csslt 27713   |s cscut 27715
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 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663
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 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3344  df-reu 3345  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-tp 4579  df-op 4581  df-uni 4858  df-int 4896  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6305  df-on 6306  df-suc 6308  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-f1 6482  df-fo 6483  df-f1o 6484  df-fv 6485  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-1o 8380  df-2o 8381  df-no 27574  df-slt 27575  df-bday 27576  df-sslt 27714  df-scut 27716
This theorem is referenced by:  madeval  27786  madeval2  27787  scutfo  27843  madefi  27851
  Copyright terms: Public domain W3C validator