MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rmo5 Structured version   Visualization version   GIF version

Theorem rmo5 3387
Description: Restricted "at most one" in term of uniqueness. (Contributed by NM, 16-Jun-2017.)
Assertion
Ref Expression
rmo5 (∃*𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))

Proof of Theorem rmo5
StepHypRef Expression
1 moeu 2611 . 2 (∃*𝑥(𝑥𝐴𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) → ∃!𝑥(𝑥𝐴𝜑)))
2 df-rmo 3369 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
3 df-rex 3090 . . 3 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
4 df-reu 3370 . . 3 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
53, 4imbi12i 353 . 2 ((∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) → ∃!𝑥(𝑥𝐴𝜑)))
61, 2, 53bitr4i 306 1 (∃*𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wex 1809  wcel 2143  ∃*wmo 2565  ∃!weu 2596  wrex 3089  ∃!wreu 3367  ∃*wrmo 3368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038
This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-mo 2567  df-eu 2597  df-rex 3090  df-rmo 3369  df-reu 3370
This theorem is referenced by:  nrexrmo  3388  cbvrmo  3409  2reurex  3724  rmo0  4318  rmosn  4686  ddemeas  34607  iccpartdisj  48169
  Copyright terms: Public domain W3C validator