fn inlist_intersection(l1: InList, l2: &InList, negated: bool) -> Result<Expr>
Return the intersection of two inlist expressions maintaining the order of the elements in the two lists