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

Theorem reu6i 3593
Description: A condition which implies existential uniqueness. (Contributed by Mario Carneiro, 2-Oct-2015.)
Assertion
Ref Expression
reu6i ((𝐵𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝐵)) → ∃!𝑥𝐴 𝜑)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reu6i
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqeq2 2810 . . . . 5 (𝑦 = 𝐵 → (𝑥 = 𝑦𝑥 = 𝐵))
21bibi2d 334 . . . 4 (𝑦 = 𝐵 → ((𝜑𝑥 = 𝑦) ↔ (𝜑𝑥 = 𝐵)))
32ralbidv 3167 . . 3 (𝑦 = 𝐵 → (∀𝑥𝐴 (𝜑𝑥 = 𝑦) ↔ ∀𝑥𝐴 (𝜑𝑥 = 𝐵)))
43rspcev 3497 . 2 ((𝐵𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝐵)) → ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
5 reu6 3591 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
64, 5sylibr 226 1 ((𝐵𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝐵)) → ∃!𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 385   = wceq 1653  wcel 2157  wral 3089  wrex 3090  ∃!wreu 3091
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-ext 2777
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2591  df-eu 2609  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ral 3094  df-rex 3095  df-reu 3096  df-v 3387
This theorem is referenced by:  eqreu  3594  riota5f  6864  negeu  10562  creur  11306  creui  11307  reuccats1OLD  13782  reuccatpfxs1  13817  lublecl  17304  dfod2  18294  lmieu  26032  esum2dlem  30670  poimirlem16  33914  poimirlem17  33915  poimirlem19  33917  poimirlem20  33918  poimirlem22  33920  renegeulemv  38007
  Copyright terms: Public domain W3C validator