reserve i,j,k,n,m for Nat,
  x,y,z,y1,y2 for object, X,Y,D for set,
  p,q for XFinSequence;
reserve k1,k2 for Nat;
reserve D for non empty set,
  F,G for XFinSequence of D,
  b for BinOp of D,
  d,d1,d2 for Element of D;
reserve F for XFinSequence,
        rF,rF1,rF2 for real-valued XFinSequence,
        r for Real,
        cF,cF1,cF2 for complex-valued XFinSequence,
        c,c1,c2 for Complex;
reserve r,s for XFinSequence;

theorem
  q c= r implies p^q c= p^r
proof
  assume q c= r;
  then consider s such that
A1: q^s = r by Th78;
  p^q c= p^q^s by AFINSQ_1:74;
  hence thesis by A1,AFINSQ_1:27;
end;
