The rule of sum counts alternatives in disjoint finite sets by adding their sizes. For a disjoint union , each element belongs to exactly one alternative, so . Overlapping alternatives require accounting for repeated elements, as in the inclusion-exclusion principle. The groups indexed by first-return position in the Catalan recurrence are disjoint alternatives.