I'm self studying proofs (reading 'How to Prove it') and am stuck on how to prove this one. I'm hoping someone can tell me how they would go about.
A little more background. This problem is in a chapter on Quantifiers. I often get stuck when the 'Givens' in a proof all have universal quantifiers and no proven elements that I can plug in. As I have read, you can only do universal instantiation if you have a particular value you can plug in.
Anyway, any help is MUCH appreciated :)
If F ⊆ G then ∩G ⊆ ∩F