thus Sum (digits (266,10)) = 14 by Th165; :: according to NUMBER11:def 1 :: thesis: ( 14 divides 266 & ( for m being Nat st Sum (digits (m,10)) = 14 & 14 divides m holds
266 <= m ) )

266 = 19 * 14 ;
hence 14 divides 266 by INT_1:def 3; :: thesis: for m being Nat st Sum (digits (m,10)) = 14 & 14 divides m holds
266 <= m

let m be Nat; :: thesis: ( Sum (digits (m,10)) = 14 & 14 divides m implies 266 <= m )
assume A1: ( Sum (digits (m,10)) = 14 & 14 divides m ) ; :: thesis: 266 <= m
then consider j being Nat such that
A2: m = 14 * j by NAT_D:def 3;
assume m < 266 ; :: thesis: contradiction
then 14 * j < 14 * 19 by A2;
then j < 18 + 1 by XREAL_1:64;
then j <= 18 by NAT_1:9;
then not not j = 0 & ... & not j = 18 ;
per cases then ( j = 0 or j = 1 or j = 2 or j = 3 or j = 4 or j = 5 or j = 6 or j = 7 or j = 8 or j = 9 or j = 10 or j = 11 or j = 12 or j = 13 or j = 14 or j = 15 or j = 16 or j = 17 or j = 18 ) ;
suppose j = 0 ; :: thesis: contradiction
end;
suppose j = 1 ; :: thesis: contradiction
end;
suppose j = 2 ; :: thesis: contradiction
end;
suppose j = 3 ; :: thesis: contradiction
end;
suppose j = 4 ; :: thesis: contradiction
end;
suppose j = 5 ; :: thesis: contradiction
end;
suppose j = 6 ; :: thesis: contradiction
end;
suppose j = 7 ; :: thesis: contradiction
end;
suppose j = 8 ; :: thesis: contradiction
end;
suppose j = 9 ; :: thesis: contradiction
end;
suppose j = 10 ; :: thesis: contradiction
end;
suppose j = 11 ; :: thesis: contradiction
end;
suppose j = 12 ; :: thesis: contradiction
end;
suppose j = 13 ; :: thesis: contradiction
end;
suppose j = 14 ; :: thesis: contradiction
end;
suppose j = 15 ; :: thesis: contradiction
end;
suppose j = 16 ; :: thesis: contradiction
end;
suppose j = 17 ; :: thesis: contradiction
end;
suppose j = 18 ; :: thesis: contradiction
end;
end;