**Defined in theory: Slot-constraint-sugar****Source code: slot-constraint-sugar.lisp**

**Documentation:**A binary relation HAS-AT-LEAST n values on domain instance i if there exist at least n distinct values v_j such that R(i,v_j) holds.

When used in the definition of a class where ?i is the instance variable, (HAS-AT-LEAST ?i R n) means that the slot R must have at least n values on all instances of the class.

**Arity:**3

(Nth-Domain Has-At-Least 3 Natural) (Nth-Domain Has-At-Least 2 Binary-Relation) (<=> (Has-At-Least ?Instance ?Binary-Relation ?N) (And (Binary-Relation ?Binary-Relation) (Natural ?N) (>= (Value-Cardinality ?Instance ?Binary-Relation) ?N)))

**See-Also:**minimum-slot-cardinality value-cardinality