set A = the non empty set ;
set m = the BinOp of the non empty set ;
take BCIStr(# the non empty set , the BinOp of the non empty set #) ; :: thesis: ( not BCIStr(# the non empty set , the BinOp of the non empty set #) is empty & BCIStr(# the non empty set , the BinOp of the non empty set #) is strict )
thus not the carrier of BCIStr(# the non empty set , the BinOp of the non empty set #) is empty ; :: according to STRUCT_0:def 1 :: thesis: BCIStr(# the non empty set , the BinOp of the non empty set #) is strict
thus BCIStr(# the non empty set , the BinOp of the non empty set #) is strict ; :: thesis: verum