let f be FinSequence of (TOP-REAL 2); :: thesis: ( f <> {} implies X_axis f <> {} )
assume ( f <> {} & X_axis f = {} ) ; :: thesis: contradiction
then ( len (X_axis f) = len f & len f <> 0 & len (X_axis f) = 0 ) by GOBOARD1:def 3;
hence contradiction ; :: thesis: verum