let n, b be Nat; :: thesis: value ((n --> 0),b) = 0
consider d being XFinSequence of NAT such that
A1: dom d = dom (n --> 0) and
A2: for i being Nat st i in dom d holds
d . i = ((n --> 0) . i) * (b |^ i) and
A3: value ((n --> 0),b) = Sum d by NUMERAL1:def 1;
for k being Nat st k in dom d holds
d . k = (n --> 0) . k
proof
let i be Nat; :: thesis: ( i in dom d implies d . i = (n --> 0) . i )
assume A4: i in dom d ; :: thesis: d . i = (n --> 0) . i
d . i = ((n --> 0) . i) * (b |^ i) by A2, A4;
hence d . i = (n --> 0) . i ; :: thesis: verum
end;
then d = n --> 0 by A1, AFINSQ_1:8;
then Sum d = n * 0 by AFINSQ_2:58;
hence value ((n --> 0),b) = 0 by A3; :: thesis: verum