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

Existential Quantifier (∃)

Master existential quantification to express statements about the existence of elements with specific properties.

Existential Quantifier (∃)

What You'll Learn

You'll learn how to use the existential quantifier to express that at least one element exists with a specific property.

The Core Idea

In the previous lesson, you learned the universal quantifier (∀) means "for all." The existential quantifier (∃) means "there exists" or "there is at least one."

When you write ∃x P(x), you're saying: "There exists at least one value of x for which the predicate P(x) is true."

Plain English Examples

Think of it like searching a crowd:

  • ∀x (Person(x) → HasTicket(x)) means "Everyone has a ticket"
  • ∃x (Person(x) ∧ HasTicket(x)) means "At least one person has a ticket"

The existential quantifier only needs to find one example to be true. If even a single element satisfies the condition, the statement is true.

How It Works

Let's say we have a predicate IsEven(x) over the domain {1, 2, 3, 4}.

  • ∃x IsEven(x) asks: "Is there at least one even number?"
  • We check: IsEven(1)? No. IsEven(2)? Yes!
  • We found one example, so ∃x IsEven(x) is TRUE

Compare this to the universal quantifier:

  • ∀x IsEven(x) would be FALSE because not all numbers are even
  • ∃x IsEven(x) is TRUE because at least one number is even

Negation

The negation of ∃x P(x) is ∀x ¬P(x):

  • "There exists an even number" negates to "All numbers are not even"

Key Takeaway: The existential quantifier (∃) asserts that at least one element in a domain satisfies a given predicate—you only need to find one example to prove it true.