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

Theorem rmo5 3362
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 2587 . 2 (∃*𝑥(𝑥𝐴𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) → ∃!𝑥(𝑥𝐴𝜑)))
2 df-rmo 3344 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
3 df-rex 3064 . . 3 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
4 df-reu 3345 . . 3 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
53, 4imbi12i 351 . 2 ((∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) → ∃!𝑥(𝑥𝐴𝜑)))
61, 2, 53bitr4i 304 1 (∃*𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wex 1786  wcel 2119  ∃*wmo 2541  ∃!weu 2572  wrex 3063  ∃!wreu 3342  ∃*wrmo 3343
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015
This theorem depends on definitions:  df-bi 208  df-an 397  df-ex 1787  df-mo 2543  df-eu 2573  df-rex 3064  df-rmo 3344  df-reu 3345
This theorem is referenced by:  nrexrmo  3363  cbvrmo  3384  2reurex  3701  rmo0  4290  rmosn  4651  ddemeas  34420  iccpartdisj  47912
  Copyright terms: Public domain W3C validator