verify that the first set is a subset of the second
verify(expr1, expr2, `subset`)
verify(expr1, expr2, '`subset`(ver)')
anything, assumed to be of type set
verification for the set operands
The verify(expr1, expr2, `subset`) and verify(expr1, expr2, '`subset`(ver)') calling sequences return true if for every operand in the first set it can be determined that there is an operand in the second set which satisfies a relationship that is determined either by testing with equality or by using the verification ver.
If true is returned, then it has been determined that each operand of the first set satisfies the relationship with at least one element in the second set. If false is returned, then there is at least one operand in the first set which does not satisfy the relationship (a result of type verify(false)) with each operand of the second set. Otherwise, FAIL is returned.
The relation of a proper subset can be implemented as the verification And(`subset`(ver), Not(set(ver))). This verification is not symmetric.
If either expr1 or expr2 is not of type set, then false is returned.
The name subset is a keyword and therefore it must be enclosed by backquotes in a call to verify.
Consider the lattice of subsets of the set a,b,c,d,e,f,g. Given the point a,b,d, select all points which precede this point:
Download Help Document
What kind of issue would you like to report? (Optional)