Theorem exmonim 2065

Description: There is at most one of something which does not exist. Unlike exmodc 2064 there is no decidability condition. (Contributed by Jim Kingdon, 22-Sep-2018.)

Assertion

Ref	Expression
exmonim	⊢ (¬ ∃𝑥𝜑 → ∃*𝑥𝜑)

Proof of Theorem exmonim

Step	Hyp	Ref	Expression
1		pm2.21 607	. 2 ⊢ (¬ ∃𝑥𝜑 → (∃𝑥𝜑 → ∃!𝑥𝜑))
2		df-mo 2018	. 2 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑))
3	1, 2	sylibr 133	1 ⊢ (¬ ∃𝑥𝜑 → ∃*𝑥𝜑)

Syntax hints:  ¬ wn 3   → wi 4  ∃wex 1480  ∃!weu 2014  ∃*wmo 2015

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in2 605

This theorem depends on definitions:  df-bi 116  df-mo 2018

This theorem is referenced by: (None)