let a, b be Ordinal; :: thesis: ( ( a <> 0 implies omega -exponent b in omega -exponent (last (CantorNF a)) ) implies a (+) b = a +^ b )
assume A1: ( a <> 0 implies omega -exponent b in omega -exponent (last (CantorNF a)) ) ; :: thesis: a (+) b = a +^ b
per cases ( a = 0 or b = 0 or ( a <> 0 & b <> 0 ) ) ;
end;