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

Theorem cleljustALT2 2185
Description: Alternate proof of cleljust 1995. Compared with cleljustALT 2184, it uses nfv 1840 followed by equsexv 2106 instead of ax-5 1836 followed by equsexhv 2146, so it uses the idiom 𝑥𝜑 instead of 𝜑 → ∀𝑥𝜑 to express non-freeness. This style is generally preferred for later theorems. (Contributed by NM, 28-Jan-2004.) (Revised by Mario Carneiro, 21-Dec-2016.) (Revised by BJ, 29-Dec-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
cleljustALT2 (𝑥𝑦 ↔ ∃𝑧(𝑧 = 𝑥𝑧𝑦))
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧

Proof of Theorem cleljustALT2
StepHypRef Expression
1 nfv 1840 . . 3 𝑧 𝑥𝑦
2 elequ1 1994 . . 3 (𝑧 = 𝑥 → (𝑧𝑦𝑥𝑦))
31, 2equsexv 2106 . 2 (∃𝑧(𝑧 = 𝑥𝑧𝑦) ↔ 𝑥𝑦)
43bicomi 214 1 (𝑥𝑦 ↔ ∃𝑧(𝑧 = 𝑥𝑧𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 384  wex 1701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-12 2044
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1702  df-nf 1707
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator