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

Theorem mormo 3373
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 2579 . 2 (∃*𝑥𝜑 → ∃*𝑥(𝑥𝐴𝜑))
2 df-rmo 3368 . 2 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
31, 2sylibr 237 1 (∃*𝑥𝜑 → ∃*𝑥𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400  wcel 2142  ∃*wmo 2564  ∃*wrmo 3367
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037
This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-mo 2566  df-rmo 3368
This theorem is used by:  reueq  3699  reusv1  5367  brdom4  10520  phpreu  38283
  Copyright terms: Public domain W3C validator