let n be Nat; :: thesis: for b being non trivial Nat holds (digits (n,b)) . 0 = n mod b
let b be non trivial Nat; :: thesis: (digits (n,b)) . 0 = n mod b
n mod b = ((b * (value ((mid ((digits (n,b)),2,(len (digits (n,b))))),b))) + ((digits (n,b)) . 0)) mod b by NEWTON03:def 1, NUMERAL2:19
.= ((digits (n,b)) . 0) mod b by NAT_D:21 ;
hence (digits (n,b)) . 0 = n mod b by ND0, NAT_D:24; :: thesis: verum