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

Theorem mormo 3147
Description: Unrestricted "at most one" implies restricted "at most one". (Contributed by NM, 16-Jun-2017.)
Assertion
Ref Expression
mormo (∃*𝑥𝜑 → ∃*𝑥𝐴 𝜑)

Proof of Theorem mormo
StepHypRef Expression
1 moan 2523 . 2 (∃*𝑥𝜑 → ∃*𝑥(𝑥𝐴𝜑))
2 df-rmo 2915 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
31, 2sylibr 224 1 (∃*𝑥𝜑 → ∃*𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wcel 1987  ∃*wmo 2470  ∃*wrmo 2910
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-10 2016  ax-12 2044
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ex 1702  df-nf 1707  df-eu 2473  df-mo 2474  df-rmo 2915
This theorem is referenced by:  reueq  3386  reusv1  4826  reusv1OLD  4827  brdom4  9296  phpreu  33022
  Copyright terms: Public domain W3C validator