Theorem rmo5 2525

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 1904	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
2		df-rmo 2314	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
3		df-rex 2312	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
4		df-reu 2313	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
5	3, 4	imbi12i 228	. 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
6	1, 2, 5	3bitr4i 201	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 → ∃!𝑥 ∈ 𝐴 𝜑))

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98  ∃wex 1381   ∈ wcel 1393  ∃!weu 1900  ∃*wmo 1901  ∃wrex 2307  ∃!wreu 2308  ∃*wrmo 2309

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101

This theorem depends on definitions:  df-bi 110  df-mo 1904  df-rex 2312  df-reu 2313  df-rmo 2314

This theorem is referenced by:  nrexrmo  2526  cbvrmo  2532  bdrmo  9976