---
title: Uniqueness quantification
slug: uniqueness-quantification
qid: 
snapshot: enwiki-001352045701
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1352045701
tags: [20477123, 20477268, 23118434, 23603337, 24043274, 29176138, 29265205, 54519761]
---

# Uniqueness quantification

> [!note] Provenance
> Snapshot `enwiki-001352045701` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1352045701> · Licensed CC BY-SA 4.0

In mathematics and logic, the term "uniqueness" refers to the property of being the one and only object satisfying a certain condition. This sort of quantification is known as uniqueness quantification or unique existential quantification, and is often denoted with the symbols "∃!" or "∃ =1 ". It is defined to mean there exists an object with the given property, and all objects with this property are equal. For example, the formal statement : \exists! n \in \mathbb{N}\,(n - 2 = 4) may be read as "there is exactly one natural number n such that ".

In mathematics and logic, the term "uniqueness" refers to the property of being the one and only object satisfying a certain condition. This sort of quantification is known as uniqueness quantification or unique existential quantification, and is often denoted with the symbols "∃!" or "∃ =1 ". It is defined to mean there exists an object with the given property, and all objects with this property are equal. For example, the formal statement \exists! n \in \mathbb{N}\,(n - 2 = 4) may be read as "there is exactly one natural number n such that ". For example, to show that the equation x + 2 = 5 has exactly one solution, one would first start by establishing that at least one solution exists, namely 3; the proof of this part is simply the verification that the equation below holds: 3 + 2 = 5 . To establish the uniqueness of the solution, one would proceed by assuming that there are two solutions, namely a and , satisfying . That is, a + 2 = 5\text{ and }b + 2 = 5 . Then since equality is a transitive relation, a + 2 = b + 2 . Subtracting 2 from both sides then yields a = b , which completes the proof that 3 is the unique solution of x + 2 = 5 . In general, both existence (there exists at least one object) and uniqueness (there exists at most one object) must be proven, in order to conclude that there exists exactly one object satisfying a said condition. An alternative way to prove uniqueness is to prove that there exists an object a satisfying the condition, and then to prove that every object satisfying the condition must be equal to . \exists x \, ( P(x) \wedge \forall y\,(P(y) \to y = x)) . An equivalent definition that separates the notions of existence and uniqueness into two clauses, at the expense of brevity, is \exists x\, P(x) \wedge \forall y\, \forall z\,[(P(y) \wedge P(z)) \to y = z] .
