let S be ManySortedSign ; :: thesis: ( S is void implies ( S is unsplit & S is gate`1=arity & S is gate`2isBoolean ) )
assume A1: the carrier' of S is empty ; :: according to STRUCT_0:def 13 :: thesis: ( S is unsplit & S is gate`1=arity & S is gate`2isBoolean )
hence the ResultSort of S = {}
.= id the carrier' of S by A1 ;
:: according to CIRCCOMB:def 7 :: thesis: ( S is gate`1=arity & S is gate`2isBoolean )
thus S is gate`1=arity by A1; :: thesis: S is gate`2isBoolean
let g be set ; :: according to CIRCCOMB:def 9 :: thesis: ( not g in the carrier' of S or for b1 being set holds
( not b1 = the Arity of S . g or ex b2 being Element of K23(K24(((len b1) -tuples_on BOOLEAN),BOOLEAN)) st g = [(g `1),b2] ) )

thus ( not g in the carrier' of S or for b1 being set holds
( not b1 = the Arity of S . g or ex b2 being Element of K23(K24(((len b1) -tuples_on BOOLEAN),BOOLEAN)) st g = [(g `1),b2] ) ) by A1; :: thesis: verum