Best possible bounds concerning the set-wise union of families

For two families of sets F,G⊂2[n] we define their set-wise union, F∨G={F∪G:F∈F,G∈G} and establish several - hopefully useful - inequalities concerning |F∨G|. Some applications are provided as well.