![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fnoa | Structured version Visualization version GIF version |
Description: Functionality and domain of ordinal addition. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 8-Sep-2013.) |
Ref | Expression |
---|---|
fnoa | ⊢ +𝑜 Fn (On × On) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-oadd 7721 | . 2 ⊢ +𝑜 = (𝑥 ∈ On, 𝑦 ∈ On ↦ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦)) | |
2 | fvex 6344 | . 2 ⊢ (rec((𝑧 ∈ V ↦ suc 𝑧), 𝑥)‘𝑦) ∈ V | |
3 | 1, 2 | fnmpt2i 7393 | 1 ⊢ +𝑜 Fn (On × On) |
Colors of variables: wff setvar class |
Syntax hints: Vcvv 3351 ↦ cmpt 4864 × cxp 5248 Oncon0 5865 suc csuc 5867 Fn wfn 6025 ‘cfv 6030 reccrdg 7662 +𝑜 coa 7714 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-ral 3066 df-rex 3067 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-nul 4064 df-if 4227 df-sn 4318 df-pr 4320 df-op 4324 df-uni 4576 df-iun 4657 df-br 4788 df-opab 4848 df-mpt 4865 df-id 5158 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-fv 6038 df-oprab 6800 df-mpt2 6801 df-1st 7319 df-2nd 7320 df-oadd 7721 |
This theorem is referenced by: cantnfvalf 8730 dmaddpi 9918 |
Copyright terms: Public domain | W3C validator |