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

Theorem reu6i 3364
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 2621 . . . . 5 (𝑦 = 𝐵 → (𝑥 = 𝑦𝑥 = 𝐵))
21bibi2d 331 . . . 4 (𝑦 = 𝐵 → ((𝜑𝑥 = 𝑦) ↔ (𝜑𝑥 = 𝐵)))
32ralbidv 2969 . . 3 (𝑦 = 𝐵 → (∀𝑥𝐴 (𝜑𝑥 = 𝑦) ↔ ∀𝑥𝐴 (𝜑𝑥 = 𝐵)))
43rspcev 3282 . 2 ((𝐵𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝐵)) → ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
5 reu6 3362 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃𝑦𝐴𝑥𝐴 (𝜑𝑥 = 𝑦))
64, 5sylibr 223 1 ((𝐵𝐴 ∧ ∀𝑥𝐴 (𝜑𝑥 = 𝐵)) → ∃!𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wral 2896  wrex 2897  ∃!wreu 2898
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-reu 2903  df-v 3175
This theorem is referenced by:  eqreu  3365  riota5f  6535  negeu  10150  creur  10891  creui  10892  reuccats1  13332  lublecl  16812  dfod2  17804  lmieu  25476  esum2dlem  29481  poimirlem16  32595  poimirlem17  32596  poimirlem19  32598  poimirlem20  32599  poimirlem22  32601  reuccatpfxs1  40297
  Copyright terms: Public domain W3C validator