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

Theorem reuv 3523
Description: A unique existential quantifier restricted to the universe is unrestricted. (Contributed by NM, 1-Nov-2010.)
Assertion
Ref Expression
reuv (∃!𝑥 ∈ V 𝜑 ↔ ∃!𝑥𝜑)

Proof of Theorem reuv
StepHypRef Expression
1 df-reu 3147 . 2 (∃!𝑥 ∈ V 𝜑 ↔ ∃!𝑥(𝑥 ∈ V ∧ 𝜑))
2 vex 3499 . . . 4 𝑥 ∈ V
32biantrur 533 . . 3 (𝜑 ↔ (𝑥 ∈ V ∧ 𝜑))
43eubii 2670 . 2 (∃!𝑥𝜑 ↔ ∃!𝑥(𝑥 ∈ V ∧ 𝜑))
51, 4bitr4i 280 1 (∃!𝑥 ∈ V 𝜑 ↔ ∃!𝑥𝜑)
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  wcel 2114  ∃!weu 2653  ∃!wreu 3142  Vcvv 3496
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-ext 2795
This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-reu 3147  df-v 3498
This theorem is referenced by:  euen1  8581  updjud  9365  hlimeui  29019
  Copyright terms: Public domain W3C validator