theorem :: GLIB_013:104

for G being _Graph
for C being Component of G holds
( G .minDegree() c= C .minDegree() & G .minInDegree() c= C .minInDegree() & G .minOutDegree() c= C .minOutDegree() )