let G be locally-finite _Graph; :: thesis: for n being Nat holds
( G .minDegree() = n iff ex v being Vertex of G st
( v .degree() = n & ( for w being Vertex of G holds v .degree() <= w .degree() ) ) )
let n be Nat; :: thesis: ( G .minDegree() = n iff ex v being Vertex of G st
( v .degree() = n & ( for w being Vertex of G holds v .degree() <= w .degree() ) ) )

hereby :: thesis: ( ex v being Vertex of G st
( v .degree() = n & ( for w being Vertex of G holds v .degree() <= w .degree() ) ) implies G .minDegree() = n )

assume G .minDegree() = n ; :: thesis: ex v being Vertex of G st
( v .degree() = n & ( for w being Vertex of G holds v .degree() <= w .degree() ) )
then consider v being Vertex of G such that
A1: v .degree() = n and
A2: for w being Vertex of G holds v .degree() c= w .degree() by Th36;
take v = v; :: thesis: ( v .degree() = n & ( for w being Vertex of G holds v .degree() <= w .degree() ) )
thus v .degree() = n by A1; :: thesis: for w being Vertex of G holds v .degree() <= w .degree()
let w be Vertex of G; :: thesis: v .degree() <= w .degree()
Segm (v .degree()) c= Segm (w .degree()) by A2;
hence v .degree() <= w .degree() by NAT_1:39; :: thesis: verum

end;

given v being Vertex of G such that A3: v .degree() = n and
A4: for w being Vertex of G holds v .degree() <= w .degree() ; :: thesis: G .minDegree() = n

now :: thesis: for w being Vertex of G holds v .degree() c= w .degree()

let w be Vertex of G; :: thesis: v .degree() c= w .degree()
Segm (v .degree()) c= Segm (w .degree()) by A4, NAT_1:39;
hence v .degree() c= w .degree() ; :: thesis: verum

end;

hence G .minDegree() = n by A3, Th36; :: thesis: verum