title: How to find if multiple sets are all found in multiple tuples (but never the same tuple)?
body: <p>I have a list of lists, which each consists of three tuples of four-value combinations of the integers <code>0</code> to <code>11</code>, e.g.: </p>
  
  <pre><code>[(0, 1, 4, 7), (2, 3, 6, 9), (5, 8, 10, 11)]
  </code></pre>
  
  <p>I want to be able to find if this list (and others) contains certain integers in at least one of the tuples, and contains other integers in at least one of the other tuples. </p>
  
  <p>It's simple enough if I want to check if at least <em>one</em> tuple contains certain integers. For instance, you could have something like:</p>
  
  <pre><code>def func_1(lst):
      for tup in lst:
          if {0,1}.issubset(tup):
              return True
      return False
  </code></pre>
  
  <p>which returns <code>True</code> for <code>[(0, 1, 4, 7), (2, 3, 6, 9), (5, 8, 10, 11)]</code><br>
  ...but <code>False</code> for  <code>[(0, 4, 7, 9), (1, 2, 3, 6), (5, 8, 10, 11)]</code></p>
  
  <p>But what if I want to find if one tuple contains <code>{0,1}</code> and another <em>separate</em> tuple contains <code>{2, 3}</code>? Something like this won't work:</p>
  
  <pre><code>def func_2(lst):
      for tup in lst:
          if {0,1}.issubset(tup) or {2,3}.issubset(tup):
              return True
      return False
  </code></pre>
  
  <p>That would return <code>True</code> for both of the above lists, when it is only <code>True</code> for the first one.</p>