Three-set algebra is the smallest setting where "counting" identities become non-trivial. The Compound tab collects them:
Exactly one of $A, B, C$ — elements in exactly one of the three sets. Shades the three "only" regions.
Exactly two of $A, B, C$ — elements in exactly two of the three sets. Shades the three pairwise-but-not-triple regions, excluding the central triple intersection.
At least two of $A, B, C$ — elements in two or three sets. Combines "exactly two" with the triple intersection.
At most one of $A, B, C$ — elements in zero or one sets. Combines the outside region with the three "only" regions.
These identities are typical of how three-set Venn diagrams are applied in combinatorics, probability (inclusion-exclusion), and survey analysis. The two-set case collapses most of them — "exactly two of two" is just the intersection, "at least two of two" is also the intersection.
For comprehensive treatment, see set laws and identities.