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 2737	. . 3 ⊢ {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} = {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))}
2		eqid 2737	. . 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 2760	. . 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 8250	. 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 1464	1 ⊢ 𝐹 Fn ( No × No )

Colors of variables: wff setvar class

Syntax hints: ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∪ cun 3888 class class class wbr 5086 {copab 5148 Po wpo 5534 Fr wfr 5578 Se wse 5579 × cxp 5626 Fn wfn 6491 ‘cfv 6496 1^st c1st 7937 2^nd c2nd 7938 frecscfrecs 8227 No csur 27623 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 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5306 ax-pr 5374 ax-un 7686

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5523 df-eprel 5528 df-po 5536 df-so 5537 df-fr 5581 df-se 5582 df-we 5583 df-xp 5634 df-rel 5635 df-cnv 5636 df-co 5637 df-dm 5638 df-rn 5639 df-res 5640 df-ima 5641 df-pred 6263 df-ord 6324 df-on 6325 df-suc 6327 df-iota 6452 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7321 df-ov 7367 df-oprab 7368 df-mpo 7369 df-1st 7939 df-2nd 7940 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-1o 8402 df-2o 8403 df-no 27626 df-lts 27627 df-bday 27628 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