Algebra for min/max bounds
After posting the above I realized there was a possible solution with a different model. By viewing sets as nodes in a directed graph and edges as constraints, where $x \subseteq y$ would be translated to x -&gt; y, the final checker would simply look for a path between $a$ and $b$ in this graph. (Using DFS or BFS per this SO question).