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

Theorem reusng 4633
Description: Restricted existential uniqueness over a singleton. (Contributed by AV, 3-Apr-2023.)
Hypothesis
Ref Expression
ralsng.1 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
reusng (𝐴𝑉 → (∃!𝑥 ∈ {𝐴}𝜑𝜓))
Distinct variable groups:   𝑥,𝐴   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)

Proof of Theorem reusng
StepHypRef Expression
1 nfv 1933 . 2 𝑥𝜓
2 ralsng.1 . 2 (𝑥 = 𝐴 → (𝜑𝜓))
31, 2reusngf 4630 1 (𝐴𝑉 → (∃!𝑥 ∈ {𝐴}𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1559  wcel 2141  ∃!wreu 3364  {csn 4579
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-v 3455  df-sbc 3743  df-sn 4580
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator