let X be set ; :: thesis: ( X is empty implies X is finite-membered )
assume A1: X is empty ; :: thesis: X is finite-membered
let x be set ; :: according to MATROID0:def 5 :: thesis: ( not x in X or x is finite )
thus ( not x in X or x is finite ) by A1; :: thesis: verum