let CS be ClosureStr of S; :: thesis: ( CS is absolutely-additive implies CS is properly-lower-bound )
assume CS is absolutely-additive ; :: thesis: CS is properly-lower-bound
then A1: the Family of CS is absolutely-additive ;
thus the Family of CS is properly-lower-bound by A1; :: according to CLOSURE2:def 21 :: thesis: verum