From the elementary set theory, there is the formula
n(A∪B∪C) = n(A) + n(B) + n(C) - n(A∩B) - n(A∩C) - n(B∩C) + n(A∩B∩C). (1)
or, equivalently,
n(A∩B∩C) = n(A∪B∪C) - n(A) - n(B) - n(C) + n(A∩B) + n(A∩C) + n(B∩C). (2)
Therefore, n(A∩B∩C) = 30 - 15 - 18 - 16 + 7 + 6 + 7 = 1.
Regarding the explanations, read the lesson
- Advanced problems on counting elements in sub-sets of a given finite set
in this site.
Everything is explained there.