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

Theorem fnoa 8489
Description: Functionality and domain of ordinal addition. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
fnoa +o Fn (On × On)

Proof of Theorem fnoa
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-oadd 8453 . 2 +o = (𝑥 ∈ On, 𝑦 ∈ On ↦ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦))
2 fvex 6894 . 2 (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦) ∈ V
31, 2fnmpoi 8063 1 +o Fn (On × On)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  Vcvv 3455  cmpt 5192   × cxp 5659  Oncon0 6360  suc csuc 6362   Fn wfn 6531  cfv 6536  reccrdg 8392   +o coa 8446
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-oadd 8453
This theorem is used by:  cantnfvalf  9630  dmaddpi  10879
  Copyright terms: Public domain W3C validator