norec2fn - Metamath Proof Explorer

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

Theorem norec2fn 27968

Description: The double-recursion operator on surreals yields a function on pairs of surreals. (Contributed by Scott Fenton, 20-Aug-2024.)

**Hypothesis**
Ref	Expression
norec2.1	⊢ 𝐹 = norec2 (𝐺)

**Assertion**
Ref	Expression
norec2fn	⊢ 𝐹 Fn ( No × No )

Proof of Theorem norec2fn Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2741	. . 3 ⊢ {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} = {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))}
2		eqid 2741	. . 3 ⊢ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} = {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))}
3	1, 2	noxpordfr 27963	. 2 ⊢ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Fr ( No × No )
4	1, 2	noxpordpo 27962	. 2 ⊢ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Po ( No × No )
5	1, 2	noxpordse 27964	. 2 ⊢ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Se ( No × No )
6		norec2.1	. . . 4 ⊢ 𝐹 = norec2 (𝐺)
7		df-norec2 27961	. . . 4 ⊢ norec2 (𝐺) = frecs({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))}, ( No × No ), 𝐺)
8	6, 7	eqtri 2764	. . 3 ⊢ 𝐹 = frecs({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))}, ( No × No ), 𝐺)
9	8	fpr1 8246	. 2 ⊢ (({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Fr ( No × No ) ∧ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Po ( No × No ) ∧ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1^st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1^st ‘𝑏) ∨ (1^st ‘𝑎) = (1^st ‘𝑏)) ∧ ((2^nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2^nd ‘𝑏) ∨ (2^nd ‘𝑎) = (2^nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Se ( No × No )) → 𝐹 Fn ( No × No ))
10	3, 4, 5, 9	mp3an 1470	1 ⊢ 𝐹 Fn ( No × No )

Colors of variables: wff setvar class

Syntax hints: ∨ wo 854 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 ∪ cun 3882 class class class wbr 5074 {copab 5136 Po wpo 5526 Fr wfr 5570 Se wse 5571 × cxp 5618 Fn wfn 6483 ‘cfv 6488 1^st c1st 7931 2^nd c2nd 7932 frecscfrecs 8223 No csur 27624 L cleft 27837 R cright 27838 norec2 cnorec2 27960

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-1st 7933 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-1o 8399 df-2o 8400 df-no 27627 df-lts 27628 df-bday 27629 df-slts 27770 df-cuts 27772 df-made 27839 df-old 27840 df-left 27842 df-right 27843 df-norec2 27961

This theorem is referenced by: addsfn 27973 mulsfn 28120

W3C validator