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

Theorem equsexh 2443
Description: An equivalence related to implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2390. See equsexhv 2300 for a version with a disjoint variable condition which does not require ax-13 2390. (Contributed by NM, 5-Aug-1993.) (New usage is discouraged.)
Hypotheses
Ref Expression
equsalh.1 (𝜓 → ∀𝑥𝜓)
equsalh.2 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
equsexh (∃𝑥(𝑥 = 𝑦𝜑) ↔ 𝜓)

Proof of Theorem equsexh
StepHypRef Expression
1 equsalh.1 . . 3 (𝜓 → ∀𝑥𝜓)
21nf5i 2150 . 2 𝑥𝜓
3 equsalh.2 . 2 (𝑥 = 𝑦 → (𝜑𝜓))
42, 3equsex 2440 1 (∃𝑥(𝑥 = 𝑦𝜑) ↔ 𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wal 1535  wex 1780
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-10 2145  ax-12 2177  ax-13 2390
This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781  df-nf 1785
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator