take A = 1-sorted(# (n -Matrices_over L) #); :: thesis: ( A is strict & not A is empty & A is n,L -matrix-membered )
thus A is strict ; :: thesis: ( not A is empty & A is n,L -matrix-membered )
thus not A is empty ; :: thesis: A is n,L -matrix-membered
thus A is n,L -matrix-membered ; :: thesis: verum