Theorem scutf 33268

Description: Functionhood 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.

Step	Hyp	Ref	Expression
1		df-scut 33248	. . . 4 ⊢ |s = (𝑎 ∈ 𝒫 No , 𝑏 ∈ ( <<s “ {𝑎}) ↦ (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
2	1	mpofun 7270	. . 3 ⊢ Fun |s
3		dmscut 33267	. . 3 ⊢ dom |s = <<s
4		df-fn 6352	. . 3 ⊢ ( |s Fn <<s ↔ (Fun |s ∧ dom |s = <<s ))
5	2, 3, 4	mpbir2an 709	. 2 ⊢ |s Fn <<s
6	1	rnmpo 7278	. . 3 ⊢ ran |s = {𝑧 ∣ ∃𝑎 ∈ 𝒫 No ∃𝑏 ∈ ( <<s “ {𝑎})𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))}
7		vex 3497	. . . . . . . . . 10 ⊢ 𝑎 ∈ V
8		vex 3497	. . . . . . . . . 10 ⊢ 𝑏 ∈ V
9	7, 8	elimasn 5948	. . . . . . . . 9 ⊢ (𝑏 ∈ ( <<s “ {𝑎}) ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
10		df-br 5059	. . . . . . . . 9 ⊢ (𝑎 <<s 𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ <<s )
11	9, 10	bitr4i 280	. . . . . . . 8 ⊢ (𝑏 ∈ ( <<s “ {𝑎}) ↔ 𝑎 <<s 𝑏)
12		scutval 33260	. . . . . . . . 9 ⊢ (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})))
13		scutcut 33261	. . . . . . . . . 10 ⊢ (𝑎 <<s 𝑏 → ((𝑎 |s 𝑏) ∈ No ∧ 𝑎 <<s {(𝑎 |s 𝑏)} ∧ {(𝑎 |s 𝑏)} <<s 𝑏))
14	13	simp1d 1138	. . . . . . . . 9 ⊢ (𝑎 <<s 𝑏 → (𝑎 |s 𝑏) ∈ No )
15	12, 14	eqeltrrd 2914	. . . . . . . 8 ⊢ (𝑎 <<s 𝑏 → (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No )
16	11, 15	sylbi 219	. . . . . . 7 ⊢ (𝑏 ∈ ( <<s “ {𝑎}) → (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No )
17		eleq1a 2908	. . . . . . 7 ⊢ ((℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) ∈ No → (𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No ))
18	16, 17	syl 17	. . . . . 6 ⊢ (𝑏 ∈ ( <<s “ {𝑎}) → (𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No ))
19	18	adantl 484	. . . . 5 ⊢ ((𝑎 ∈ 𝒫 No ∧ 𝑏 ∈ ( <<s “ {𝑎})) → (𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No ))
20	19	rexlimivv 3292	. . . 4 ⊢ (∃𝑎 ∈ 𝒫 No ∃𝑏 ∈ ( <<s “ {𝑎})𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)})) → 𝑧 ∈ No )
21	20	abssi 4045	. . 3 ⊢ {𝑧 ∣ ∃𝑎 ∈ 𝒫 No ∃𝑏 ∈ ( <<s “ {𝑎})𝑧 = (℩𝑥 ∈ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝑎 <<s {𝑦} ∧ {𝑦} <<s 𝑏)}))} ⊆ No
22	6, 21	eqsstri 4000	. 2 ⊢ ran |s ⊆ No
23		df-f 6353	. 2 ⊢ ( |s : <<s ⟶ No ↔ ( |s Fn <<s ∧ ran |s ⊆ No ))
24	5, 22, 23	mpbir2an 709	1 ⊢ |s : <<s ⟶ No

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1533   ∈ wcel 2110  {cab 2799  ∃wrex 3139  {crab 3142   ⊆ wss 3935  𝒫 cpw 4538  {csn 4560  ⟨cop 4566  ∩ cint 4868   class class class wbr 5058  dom cdm 5549  ran crn 5550   “ cima 5552  Fun wfun 6343   Fn wfn 6344  ⟶wf 6345  ‘cfv 6349  ℩crio 7107  (class class class)co 7150   No csur 33142   bday cbday 33144   <<s csslt 33245   |s cscut 33247

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-ord 6188  df-on 6189  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1o 8096  df-2o 8097  df-no 33145  df-slt 33146  df-bday 33147  df-sslt 33246  df-scut 33248

This theorem is referenced by:  madeval  33284  madeval2  33285