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

Theorem norec2fn 28401
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.
StepHypRef Expression
1 eqid 2766 . . 3 {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} = {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))}
2 eqid 2766 . . 3 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} = {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))}
31, 2noxpordfr 28396 . 2 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Fr (No × No)
41, 2noxpordpo 28395 . 2 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Po (No × No)
51, 2noxpordse 28397 . 2 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Se (No × No)
6 norec2.1 . . . 4 𝐹 = norec2 (𝐺)
7 df-norec2 28394 . . . 4 norec2 (𝐺) = frecs({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))}, (No × No), 𝐺)
86, 7eqtri 2789 . . 3 𝐹 = frecs({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))}, (No × No), 𝐺)
98fpr1 8358 . 2 (({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Fr (No × No) ∧ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Po (No × No) ∧ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ (No × No) ∧ 𝑏 ∈ (No × No) ∧ (((1st ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (1st ‘𝑏) ∨ (1st ‘𝑎) = (1st ‘𝑏)) ∧ ((2nd ‘𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ ((L‘𝑑) ∪ (R‘𝑑))} (2nd ‘𝑏) ∨ (2nd ‘𝑎) = (2nd ‘𝑏)) ∧ 𝑎 ≠ 𝑏))} Se (No × No)) → 𝐹 Fn (No × No))
103, 4, 5, 9mp3an 1493 1 𝐹 Fn (No × No)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∨ wo 861   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150   ≠ wne 2962   ∪ cun 4151   class class class wbr 5107  {copab 5172   Po wpo 5563   Fr wfr 5607   Se wse 5608   × cxp 5655   Fn wfn 6560  ‘cfv 6565  1st c1st 8032  2nd c2nd 8033  frecscfrecs 8335  Nocsur 28056  Lcleft 28270  Rcright 28271   norec2 cnorec2 28393
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-1o 8513  df-2o 8514  df-no 28059  df-lts 28060  df-bday 28061  df-slts 28203  df-cuts 28205  df-made 28272  df-old 28273  df-left 28275  df-right 28276  df-norec2 28394
This theorem is used by:  addsfn  28406  mulsfn  28553
  Copyright terms: Public domain W3C validator