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

Theorem reu6i 3685
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 2772 . . . . 5 (𝑦 = 𝐵 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐵))
21bibi2d 345 . . . 4 (𝑦 = 𝐵 → ((𝜑 ↔ 𝑥 = 𝑦) ↔ (𝜑 ↔ 𝑥 = 𝐵)))
32ralbidv 3185 . . 3 (𝑦 = 𝐵 → (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)))
43rspcev 3576 . 2 ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦))
5 reu6 3683 . 2 (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝑦))
64, 5sylibr 237 1 ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  ∃!wreu 3363
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-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3077  df-rex 3087  df-reu 3366
This theorem is used by:  eqreu  3686  riota5f  7405  negeu  11547  creur  12314  creui  12315  reuccatpfxs1  14896  lublecl  18533  dfod2  19778  lmieu  29289  reu6dv  33069  esum2dlem  34724  fvineqsneu  38335  poimirlem16  38555  poimirlem17  38556  poimirlem19  38558  poimirlem20  38559  poimirlem22  38561  renegeulemv  43420  sn-subeu  43479  upeu2lem  50136
  Copyright terms: Public domain W3C validator