Course contentsShow
← Computer Science
Lesson 47 of 2,8722. Discrete Mathematics for CSFree lesson

Universal Quantifier (∀)

Understand universal quantification and how to express statements that apply to all elements in a domain.

Universal Quantifier (∀)

What You'll Learn

You'll learn how to use the universal quantifier to express statements that apply to every element in a domain.

The Core Idea

In the last lesson, you learned about predicates — statements with variables that become true or false depending on what you plug in. But what if you want to say "this is true for everyone" or "all numbers have this property"?

That's where the universal quantifier comes in. Written as ∀ (an upside-down "A" for "All"), it lets you make sweeping statements about entire collections.

How It Works

The notation ∀x P(x) reads as: "For all x, P(x) is true."

Think of it like this: imagine you're checking ID cards at a concert. The statement "∀x (x has a ticket)" means every single person must have a ticket. If even one person doesn't, the whole statement becomes false.

Examples in Plain English

  • ∀x (x + 0 = x): "For all numbers x, adding zero gives you x back." (True!)
  • ∀n (n > 5): "All numbers are greater than 5." (False — what about 3?)
  • ∀s (s is a string): "Everything in our domain is a string." (Depends on your domain!)

The Domain Matters

The universal quantifier always operates over some domain (the set of things x can be). If your domain is "all students in this class," then ∀x means "every student in this class." Change the domain, change the meaning.

Key Takeaway: The universal quantifier ∀ lets you claim that a predicate is true for every element in a domain — but if just one counterexample exists, the entire statement is false.