HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem fnoa 4141
Description: Functionality and domain of ordinal addition.
Assertion
Ref Expression
fnoa |- +o Fn (On X. On)

Proof of Theorem fnoa
StepHypRef Expression
1 fvex 3727 . 2 |- (rec({<.w, v>. | v = suc w}, x)` y) e. V
2 df-oadd 4128 . 2 |- +o = {<.<.x, y>., z>. | ((x e. On /\ y e. On) /\ z = (rec({<.w, v>. | v = suc w}, x)` y))}
31, 2fnoprab2 4115 1 |- +o Fn (On X. On)
Colors of variables: wff set class
Syntax hints:   = wceq 955  {copab 2662  Oncon0 2944  suc csuc 2946   X. cxp 3164   Fn wfn 3173  ` cfv 3178  reccrdg 3926   +o coa 4123
This theorem is referenced by:  dmaddpi 5001
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-sep 2699  ax-nul 2706  ax-pow 2738  ax-pr 2775  ax-un 2862
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 776  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-ral 1647  df-rex 1648  df-v 1809  df-sbc 1939  df-csb 1999  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-pw 2399  df-sn 2409  df-pr 2410  df-op 2413  df-uni 2500  df-br 2616  df-opab 2663  df-id 2831  df-xp 3180  df-rel 3181  df-cnv 3182  df-co 3183  df-dm 3184  df-rn 3185  df-res 3186  df-ima 3187  df-fun 3188  df-fn 3189  df-f 3190  df-fv 3194  df-oprab 3961  df-1st 4072  df-2nd 4073  df-oadd 4128
Copyright terms: Public domain