Theorem fnoa 8418

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.

Step	Hyp	Ref	Expression
1		df-oadd 8384	. 2 ⊢ +o = (𝑥 ∈ On, 𝑦 ∈ On ↦ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦))
2		fvex 6830	. 2 ⊢ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦) ∈ V
3	1, 2	fnmpoi 7997	1 ⊢ +o Fn (On × On)

Syntax hints:  Vcvv 3436   ↦ cmpt 5167   × cxp 5609  Oncon0 6301  suc csuc 6303   Fn wfn 6471  ‘cfv 6476  reccrdg 8323   +_o coa 8377

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365  ax-un 7663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-iun 4938  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5506  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-fv 6484  df-oprab 7345  df-mpo 7346  df-1st 7916  df-2nd 7917  df-oadd 8384

This theorem is referenced by:  cantnfvalf  9550  dmaddpi  10776