Let (Gι)ι∈I be a family of graphs. Show that for every set X we have
(ι∈I⋃Gι)⟨X⟩=ι∈I⋃Gι⟨X⟩,
and that for every object x,
(ι∈I⋂Gι)⟨{x}⟩=ι∈I⋂Gι⟨{x}⟩.
Give an example of two graphs G, H and a set X such that
(G∩H)⟨X⟩=G⟨X⟩∩H⟨X⟩.
Nothing.
Nothing.