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

Theorem rmo5 3310
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 2597 . 2 (∃*𝑥(𝑥𝐴𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) → ∃!𝑥(𝑥𝐴𝜑)))
2 df-rmo 3063 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
3 df-rex 3061 . . 3 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
4 df-reu 3062 . . 3 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
53, 4imbi12i 341 . 2 ((∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) → ∃!𝑥(𝑥𝐴𝜑)))
61, 2, 53bitr4i 294 1 (∃*𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 384  wex 1874  wcel 2155  ∃*wmo 2563  ∃!weu 2581  wrex 3056  ∃!wreu 3057  ∃*wrmo 3058
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070
This theorem depends on definitions:  df-bi 198  df-an 385  df-ex 1875  df-mo 2565  df-eu 2582  df-rex 3061  df-reu 3062  df-rmo 3063
This theorem is referenced by:  nrexrmo  3311  cbvrmo  3318  ddemeas  30769  2reurex  41878  iccpartdisj  42133
  Copyright terms: Public domain W3C validator