let GF be Graph-yielding Function; :: thesis: ( GF is _trivial & GF is loopless implies GF is _finite )

per cases ( GF is empty or not GF is empty ) ;

suppose GF is empty ; :: thesis: ( GF is _trivial & GF is loopless implies GF is _finite )

hence ( GF is _trivial & GF is loopless implies GF is _finite ) ; :: thesis: verum

end;

suppose not GF is empty ; :: thesis: ( GF is _trivial & GF is loopless implies GF is _finite )

hence ( GF is _trivial & GF is loopless implies GF is _finite ) ; :: thesis: verum

end;

end;