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

Theorem norec2ov 27902
Description: The value of the double-recursion surreal function. (Contributed by Scott Fenton, 20-Aug-2024.)
Hypothesis
Ref Expression
norec2.1 𝐹 = norec2 (𝐺)
Assertion
Ref Expression
norec2ov ((𝐴 No 𝐵 No ) → (𝐴𝐹𝐵) = (⟨𝐴, 𝐵𝐺(𝐹 ↾ ((((( L ‘𝐴) ∪ ( R ‘𝐴)) ∪ {𝐴}) × ((( L ‘𝐵) ∪ ( R ‘𝐵)) ∪ {𝐵})) ∖ {⟨𝐴, 𝐵⟩}))))

Proof of Theorem norec2ov
Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ov 7429 . . 3 (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2 opelxp 5718 . . . 4 (⟨𝐴, 𝐵⟩ ∈ ( No × No ) ↔ (𝐴 No 𝐵 No ))
3 eqid 2728 . . . . . . 7 {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} = {⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))}
4 eqid 2728 . . . . . . 7 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( 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𝑏)) ∧ 𝑎𝑏))}
53, 4noxpordfr 27896 . . . . . 6 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))} Fr ( No × No )
63, 4noxpordpo 27895 . . . . . 6 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))} Po ( No × No )
73, 4noxpordse 27897 . . . . . 6 {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))} Se ( No × No )
85, 6, 73pm3.2i 1336 . . . . 5 ({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( 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 ))
9 norec2.1 . . . . . . 7 𝐹 = norec2 (𝐺)
10 df-norec2 27894 . . . . . . 7 norec2 (𝐺) = frecs({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), 𝐺)
119, 10eqtri 2756 . . . . . 6 𝐹 = frecs({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), 𝐺)
1211fpr2 8318 . . . . 5 ((({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( 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 )) ∧ ⟨𝐴, 𝐵⟩ ∈ ( No × No )) → (𝐹‘⟨𝐴, 𝐵⟩) = (⟨𝐴, 𝐵𝐺(𝐹 ↾ Pred({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), ⟨𝐴, 𝐵⟩))))
138, 12mpan 688 . . . 4 (⟨𝐴, 𝐵⟩ ∈ ( No × No ) → (𝐹‘⟨𝐴, 𝐵⟩) = (⟨𝐴, 𝐵𝐺(𝐹 ↾ Pred({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), ⟨𝐴, 𝐵⟩))))
142, 13sylbir 234 . . 3 ((𝐴 No 𝐵 No ) → (𝐹‘⟨𝐴, 𝐵⟩) = (⟨𝐴, 𝐵𝐺(𝐹 ↾ Pred({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), ⟨𝐴, 𝐵⟩))))
151, 14eqtrid 2780 . 2 ((𝐴 No 𝐵 No ) → (𝐴𝐹𝐵) = (⟨𝐴, 𝐵𝐺(𝐹 ↾ Pred({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), ⟨𝐴, 𝐵⟩))))
163, 4noxpordpred 27898 . . . 4 ((𝐴 No 𝐵 No ) → Pred({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), ⟨𝐴, 𝐵⟩) = ((((( L ‘𝐴) ∪ ( R ‘𝐴)) ∪ {𝐴}) × ((( L ‘𝐵) ∪ ( R ‘𝐵)) ∪ {𝐵})) ∖ {⟨𝐴, 𝐵⟩}))
1716reseq2d 5989 . . 3 ((𝐴 No 𝐵 No ) → (𝐹 ↾ Pred({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), ⟨𝐴, 𝐵⟩)) = (𝐹 ↾ ((((( L ‘𝐴) ∪ ( R ‘𝐴)) ∪ {𝐴}) × ((( L ‘𝐵) ∪ ( R ‘𝐵)) ∪ {𝐵})) ∖ {⟨𝐴, 𝐵⟩})))
1817oveq2d 7442 . 2 ((𝐴 No 𝐵 No ) → (⟨𝐴, 𝐵𝐺(𝐹 ↾ Pred({⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ( No × No ) ∧ 𝑏 ∈ ( No × No ) ∧ (((1st𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (1st𝑏) ∨ (1st𝑎) = (1st𝑏)) ∧ ((2nd𝑎){⟨𝑐, 𝑑⟩ ∣ 𝑐 ∈ (( L ‘𝑑) ∪ ( R ‘𝑑))} (2nd𝑏) ∨ (2nd𝑎) = (2nd𝑏)) ∧ 𝑎𝑏))}, ( No × No ), ⟨𝐴, 𝐵⟩))) = (⟨𝐴, 𝐵𝐺(𝐹 ↾ ((((( L ‘𝐴) ∪ ( R ‘𝐴)) ∪ {𝐴}) × ((( L ‘𝐵) ∪ ( R ‘𝐵)) ∪ {𝐵})) ∖ {⟨𝐴, 𝐵⟩}))))
1915, 18eqtrd 2768 1 ((𝐴 No 𝐵 No ) → (𝐴𝐹𝐵) = (⟨𝐴, 𝐵𝐺(𝐹 ↾ ((((( L ‘𝐴) ∪ ( R ‘𝐴)) ∪ {𝐴}) × ((( L ‘𝐵) ∪ ( R ‘𝐵)) ∪ {𝐵})) ∖ {⟨𝐴, 𝐵⟩}))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394  wo 845  w3a 1084   = wceq 1533  wcel 2098  wne 2937  cdif 3946  cun 3947  {csn 4632  cop 4638   class class class wbr 5152  {copab 5214   Po wpo 5592   Fr wfr 5634   Se wse 5635   × cxp 5680  cres 5684  Predcpred 6309  cfv 6553  (class class class)co 7426  1st c1st 7999  2nd c2nd 8000  frecscfrecs 8294   No csur 27601   L cleft 27800   R cright 27801   norec2 cnorec2 27893
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-rep 5289  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7748
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-tp 4637  df-op 4639  df-uni 4913  df-int 4954  df-iun 5002  df-br 5153  df-opab 5215  df-mpt 5236  df-tr 5270  df-id 5580  df-eprel 5586  df-po 5594  df-so 5595  df-fr 5637  df-se 5638  df-we 5639  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-pred 6310  df-ord 6377  df-on 6378  df-suc 6380  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-fv 6561  df-riota 7382  df-ov 7429  df-oprab 7430  df-mpo 7431  df-1st 8001  df-2nd 8002  df-frecs 8295  df-wrecs 8326  df-recs 8400  df-1o 8495  df-2o 8496  df-no 27604  df-slt 27605  df-bday 27606  df-sslt 27742  df-scut 27744  df-made 27802  df-old 27803  df-left 27805  df-right 27806  df-norec2 27894
This theorem is referenced by:  addsval  27907  mulsval  28037
  Copyright terms: Public domain W3C validator