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

Theorem mormo 3370
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 2577 . 2 (∃*𝑥𝜑 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2 df-rmo 3365 . 2 (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
31, 2sylibr 237 1 (∃*𝑥𝜑 → ∃*𝑥 ∈ 𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  ∃*wmo 2562  ∃*wrmo 3364
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-mo 2564  df-rmo 3365
This theorem is used by:  reueq  3694  reusv1  5358  brdom4  10609  phpreu  38528
  Copyright terms: Public domain W3C validator