The cardinality of a set is its size: the number of different members. ∣{red,green,blue}∣=3 and ∣∅∣=0. Because a set ignores repeats, the word MISSISSIPPI has 11 letters but its set of letters {M,I,S,P} has cardinality 4. A member that is itself a set counts as one: ∣{{1,2},3}∣=2.
Cardinality gets interesting when sets overlap. If 18 students take art, 15 take music and 6 take both, the sum 18+15=33 counts those 6 twice, once in each group. Subtracting them once gives ∣A∪M∣=18+15−6=27. That is the inclusion-exclusion principle: include both sets, then exclude the overlap. For three sets the pattern continues: add the three sizes, subtract the three pairwise overlaps, then add back the part in all three.
Don't confuse the size of a set with the number of its subsets. The set {a,b,c} has cardinality 3, but it has 23=8 subsets, because each member is either in or out of a subset: 2×2×2 choices. Adding one member adds 1 to the cardinality but doubles the number of subsets.
Think of it like this. Cardinality is the head count at a party, not the number of times the door opened: a guest who stepped out and came back is still one person. Inclusion-exclusion is how you merge two guest lists that overlap: add both lists, then subtract everyone who appears on both.
Core idea. Cardinality is the count of distinct elements in a set, written ∣A∣.