let CS be ClosureStr of S; :: thesis: ( CS is absolutely-multiplicative implies CS is properly-upper-bound )
assume CS is absolutely-multiplicative ; :: thesis: CS is properly-upper-bound
hence the Family of CS is properly-upper-bound ; :: according to CLOSURE2:def 18 :: thesis: verum