Given a list made up of subsets of an alphabet, how can I use associations to create a Boolean dictionary of the given list

Question

I have a list of 30,000 elements, each of the element is a list in itself {{a, b}, {p, q, r}, {a, p}, ..., {z, x}}. Second one contains unique elements {a, b, c, ..., z}.

I want to create an association which associates all the unique elements to the first list so that it shows whether the corresponding element is present in the first list. So, it should look something like this:

{
  {<|a -> True, b -> True, c -> False, ..., z -> False|>},
  {<| a -> False, b -> False, ..., p -> False, q -> False, r -> False, ..., z -> False |>},
   ...
}

Is there a way I can do this without loops?

Answer 1

 ClearAll @@ CharacterRange["a", "z"]

 elements = Symbol /@ CharacterRange["a", "z"]

 main = Association @ Thread[elements -> False]

<|a->False,b->False,c->False ... x->False,y->False,z->False|>

set = {{a, b}, {p, q, r}, {a, p}}

Merge[{Association@Thread[# -> True], main}, Or @@ # & ] & /@ set

{<|a -> True, b -> True, c -> False, ... x -> False, y -> False, z -> False|>, 
  <|p -> True, q -> True, r -> True, a -> False, ... z -> False|>, 
  <|a -> True, p -> True, b -> False, ... y -> False, z -> False|>}