ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  reubiia GIF version

Theorem reubiia 2675
Description: Formula-building rule for restricted existential quantifier (inference form). (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 454 . . 3 ((𝑥𝐴𝜑) ↔ (𝑥𝐴𝜓))
32eubii 2047 . 2 (∃!𝑥(𝑥𝐴𝜑) ↔ ∃!𝑥(𝑥𝐴𝜓))
4 df-reu 2475 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
5 df-reu 2475 . 2 (∃!𝑥𝐴 𝜓 ↔ ∃!𝑥(𝑥𝐴𝜓))
63, 4, 53bitr4i 212 1 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥𝐴 𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  ∃!weu 2038  wcel 2160  ∃!wreu 2470
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1458  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-4 1521  ax-17 1537  ax-ial 1545
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-eu 2041  df-reu 2475
This theorem is referenced by:  reubii  2676
  Copyright terms: Public domain W3C validator