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

Theorem reurmo 3161
Description: Restricted existential uniqueness implies restricted "at most one." (Contributed by NM, 16-Jun-2017.)
Assertion
Ref Expression
reurmo (∃!𝑥𝐴 𝜑 → ∃*𝑥𝐴 𝜑)

Proof of Theorem reurmo
StepHypRef Expression
1 reu5 3159 . 2 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∃*𝑥𝐴 𝜑))
21simprbi 480 1 (∃!𝑥𝐴 𝜑 → ∃*𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wrex 2913  ∃!wreu 2914  ∃*wrmo 2915
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-eu 2474  df-mo 2475  df-rex 2918  df-reu 2919  df-rmo 2920
This theorem is referenced by:  reuxfrd  4893  enqeq  9756  eqsqrtd  14107  efgred2  18166  0frgp  18192  frgpnabllem2  18277  frgpcyg  19922  lmieu  25676  reuxfr4d  29330  poimirlem25  33434  poimirlem26  33435  reuimrmo  41178  2reurmo  41182  2rexreu  41185  2reu2  41187
  Copyright terms: Public domain W3C validator