let k, n be Nat; :: thesis: for b being Nat holds value (((k --> 0) ^ <%n%>),b) = n * (b |^ k)
let b be Nat; :: thesis: value (((k --> 0) ^ <%n%>),b) = n * (b |^ k)
consider x being XFinSequence of NAT such that
A2: ( dom x = dom ((k --> 0) ^ <%n%>) & ( for i being Nat st i in dom x holds
x . i = (((k --> 0) ^ <%n%>) . i) * (b |^ i) ) & value (((k --> 0) ^ <%n%>),b) = Sum x ) by NUMERAL1:def 1;
A3: ( dom x = k + 1 & dom ((k --> 0) ^ <%n%>) = k + 1 ) by A2, CARD_1:def 7;
then reconsider x = x as k + 1 -element XFinSequence of NAT by CARD_1:def 7;
A4: k + 0 < k + 1 by XREAL_1:6;
A5: ((k --> 0) ^ <%n%>) . k = n ;
A6: for i being Nat st i in dom (x | k) holds
(x | k) . i = (k --> 0) . i
proof
let i be Nat; :: thesis: ( i in dom (x | k) implies (x | k) . i = (k --> 0) . i )
assume B1: i in dom (x | k) ; :: thesis: (x | k) . i = (k --> 0) . i
dom (x | k) = k by CARD_1:def 7;
then B2: i < k by B1, AFINSQ_1:86;
B3: ( (x | k) . i = x . i & i in dom x ) by AFINSQ_1:53, A3, A4, B1;
then x . i = (((k --> 0) ^ <%n%>) . i) * (b |^ i) by A2
.= 0 * (b |^ i) by Th23, B2 ;
hence (x | k) . i = (k --> 0) . i by B3; :: thesis: verum
end;
A7: x = (x | k) ^ <%(x . k)%> ;
A8: x | k = k --> 0 by A6, CARD_1:def 7;
Sum x = (Sum (x | k)) + (Sum <%(x . k)%>) by A7, AFINSQ_2:55
.= (0 * k) + (x . k) by A8
.= n * (b |^ k) by A2, A3, A4, A5, AFINSQ_1:86 ;
hence value (((k --> 0) ^ <%n%>),b) = n * (b |^ k) by A2; :: thesis: verum