A proof that some element is found in a list.
Example: the (Elem "bar" ["foo", "bar", "baz"]) (tactics { search })
Remove the element at the given position.
The list to be removed from
A proof that the element to be removed is in the list
Here
will never equal There
.
Compute the intersection of two lists according to their Eq
implementation.
intersect [1, 2, 3, 4] [2, 4, 6, 8]
The intersectBy function returns the intersect of two lists by user-supplied equality predicate.
Is the given element a member of the given list.
The element to be tested.
The list to be checked against
An item not in the head and not in the tail is not in the List at all
If the tails don't match, neither will references to them.