thus ( p <> 0_ (n,L) implies ex d being Nat st
( ex s being bag of n st
( s in Support p & d = degree s ) & ( for s1 being bag of n st s1 in Support p holds
d >= degree s1 ) ) ) :: thesis:

assume p <> 0_ (n,L) ; :: thesis:
then p <> (dom p) --> (0. L) ;
then consider b being object such that
A1: ( b in dom p & p . b <> 0. L ) by FUNCOP_1:11;
reconsider b = b as bag of n by A1;
defpred S₁[ object , object ] means for s being bag of n st s = $1 holds
$2 = degree s;
A2: for e being object st e in Support p holds
ex u being object st S₁[e,u]

let e be object ; :: thesis:
assume e in Support p ; :: thesis:
then reconsider e = e as bag of n ;
take degree e ; :: thesis:
thus S₁[e, degree e] ; :: thesis:

end;

consider D being Function such that
A3: ( dom D = Support p & ( for e being object st e in Support p holds
S₁[e,D . e] ) ) from CLASSES1:sch 1(A2);
b in Support p by A1, POLYNOM1:def 3;
then dom D <> {} by A3, XBOOLE_0:def 1;
then A4: rng D <> {} by RELAT_1:42;

let y be object ; :: thesis:
assume y in rng D ; :: thesis:
then consider x being object such that
A5: ( x in dom D & y = D . x ) by FUNCT_1:def 3;
reconsider x = x as bag of n by A5, A3;
y = degree x by A5, A3;
hence y is natural ; :: thesis:

end;

then reconsider R = rng D as non empty finite natural-membered set by A4, A3, FINSET_1:8, MEMBERED:def 6;
max R in R by XXREAL_2:def 8;
then consider s being object such that
A6: ( s in dom D & max R = D . s ) by FUNCT_1:def 3;
reconsider s = s as bag of n by A6, A3;
reconsider m = max R as Nat by A6;
take m ; :: thesis:
( s in Support p & m = degree s ) by A6, A3;
hence ex s being bag of n st
( s in Support p & m = degree s ) ; :: thesis:
let s1 be bag of n; :: thesis:
assume s1 in Support p ; :: thesis:
then ( D . s1 in R & D . s1 = degree s1 ) by FUNCT_1:def 3, A3;
hence m >= degree s1 by XXREAL_2:def 8; :: thesis:

end;

thus ( not p <> 0_ (n,L) implies ex b₁ being Nat st b₁ = 0 ) ; :: thesis: