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

Theorem reubiia 3266
 Description: Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 14-Nov-2004.)
Hypothesis
Ref Expression
reubiia.1 (𝑥𝐴 → (𝜑𝜓))
Assertion
Ref Expression
reubiia (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐴 𝜓)

Proof of Theorem reubiia
StepHypRef Expression
1 reubiia.1 . . . 4 (𝑥𝐴 → (𝜑𝜓))
21pm5.32i 672 . . 3 ((𝑥𝐴𝜑) ↔ (𝑥𝐴𝜓))
32eubii 2629 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ ∃!𝑥(𝑥𝐴𝜓))
4 df-reu 3057 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
5 df-reu 3057 . 2 (∃!𝑥𝐴 𝜓 ↔ ∃!𝑥(𝑥𝐴𝜓))
63, 4, 53bitr4i 292 1 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐴 𝜓)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   ∈ wcel 2139  ∃!weu 2607  ∃!wreu 3052 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-12 2196 This theorem depends on definitions:  df-bi 197  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-eu 2611  df-reu 3057 This theorem is referenced by:  reubii  3267  riotaxfrd  6805  infempty  8577
 Copyright terms: Public domain W3C validator