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

Theorem reusng 4634
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 1946 . 2 Ⅎ𝑥𝜓
2 ralsng.1 . 2 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
31, 2reusngf 4631 1 (𝐴 ∈ 𝑉 → (∃!𝑥 ∈ {𝐴}𝜑 ↔ 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∃!wreu 3363  {csn 4584
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  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-v 3452  df-sbc 3739  df-sn 4585
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator