Theorem fnoa 8495

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 8459	. 2 ⊢ +o = (𝑥 ∈ On, 𝑦 ∈ On ↦ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦))
2		fvex 6887	. 2 ⊢ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦) ∈ V
3	1, 2	fnmpoi 8065	1 ⊢ +o Fn (On × On)

This proof depends on syntax axioms:  Vcvv 3450   ↦ cmpt 5186   × cxp 5646  Oncon0 6352  suc csuc 6354   Fn wfn 6523  ‘cfv 6528  reccrdg 8396   +_o coa 8452

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-fv 6536  df-oprab 7413  df-mpo 7414  df-1st 7985  df-2nd 7986  df-oadd 8459

This theorem is used by:  cantnfvalf  9644  dmaddpi  10932