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

Theorem nrexrmo 3391
Description: Nonexistence implies restricted "at most one". (Contributed by NM, 17-Jun-2017.)
Assertion
Ref Expression
nrexrmo (¬ ∃𝑥𝐴 𝜑 → ∃*𝑥𝐴 𝜑)

Proof of Theorem nrexrmo
StepHypRef Expression
1 pm2.21 124 . 2 (¬ ∃𝑥𝐴 𝜑 → (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))
2 rmo5 3390 . 2 (∃*𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 → ∃!𝑥𝐴 𝜑))
31, 2sylibr 237 1 (¬ ∃𝑥𝐴 𝜑 → ∃*𝑥𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wrex 3092  ∃!wreu 3370  ∃*wrmo 3371
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2570  df-eu 2600  df-rex 3093  df-rmo 3372  df-reu 3373
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator