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

Theorem cbveu 2687
Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2386. Use the weaker cbveuw 2686 when possible. (Contributed by NM, 25-Nov-1994.) (Revised by Mario Carneiro, 7-Oct-2016.) (New usage is discouraged.)
Hypotheses
Ref Expression
cbveu.1 𝑦𝜑
cbveu.2 𝑥𝜓
cbveu.3 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
cbveu (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)

Proof of Theorem cbveu
StepHypRef Expression
1 cbveu.1 . . 3 𝑦𝜑
21sb8eu 2682 . 2 (∃!𝑥𝜑 ↔ ∃!𝑦[𝑦 / 𝑥]𝜑)
3 cbveu.2 . . . 4 𝑥𝜓
4 cbveu.3 . . . 4 (𝑥 = 𝑦 → (𝜑𝜓))
53, 4sbie 2540 . . 3 ([𝑦 / 𝑥]𝜑𝜓)
65eubii 2666 . 2 (∃!𝑦[𝑦 / 𝑥]𝜑 ↔ ∃!𝑦𝜓)
72, 6bitri 277 1 (∃!𝑥𝜑 ↔ ∃!𝑦𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wnf 1780  [wsb 2065  ∃!weu 2649
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-10 2141  ax-11 2157  ax-12 2173  ax-13 2386
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650
This theorem is referenced by:  cbvreu  3447  cbvreucsf  3926
  Copyright terms: Public domain W3C validator