Theorem rmo5 2685

Description: Restricted "at most one" in term of uniqueness. (Contributed by NM, 16-Jun-2017.)

Assertion

Ref	Expression
rmo5	⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑))

Proof of Theorem rmo5

Step	Hyp	Ref	Expression
1		df-mo 2023	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
2		df-rmo 2456	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
3		df-rex 2454	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
4		df-reu 2455	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
5	3, 4	imbi12i 238	. 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
6	1, 2, 5	3bitr4i 211	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∃wex 1485  ∃!weu 2019  ∃*wmo 2020   ∈ wcel 2141  ∃wrex 2449  ∃!wreu 2450  ∃*wrmo 2451

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107

This theorem depends on definitions:  df-bi 116  df-mo 2023  df-rex 2454  df-reu 2455  df-rmo 2456

This theorem is referenced by:  nrexrmo  2686  cbvrmo  2695  bdrmo  13891