reserve A,A1,A2,B,C,D for Ordinal,
  X,Y for set,
  x,y,a,b,c for object,
  L,L1,L2,L3 for Sequence,
  f for Function;
reserve fi,psi for Ordinal-Sequence;

theorem Th36:
  (succ B)*^A = B*^A +^ A
proof
  deffunc D(Ordinal,Sequence) = union sup $2;
  deffunc F(Ordinal) = $1*^A;
  deffunc C(Ordinal,Ordinal) = $2 +^ A;
A1: for B,C holds C = F(B) iff ex fi st C = last fi & dom fi = succ B & fi.
0 = 0 & (for C st succ C in succ B holds fi.succ C = C(C,fi.C)) & for C st C
  in succ B & C <> 0 & C is limit_ordinal holds fi.C = D(C,fi|C) by Def15;
  for B holds F(succ B) = C(B,F(B)) from OSResultS(A1);
  hence thesis;
end;
