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

Theorem dvdemo2 4864
 Description: Demonstration of a theorem (scheme) that requires (meta)variables 𝑥 and 𝑧 to be distinct, but no others. It bundles the theorem schemes ∃𝑥(𝑥 = 𝑥 → 𝑧 ∈ 𝑥) and ∃𝑥(𝑥 = 𝑦 → 𝑦 ∈ 𝑥). Compare dvdemo1 4863. (Contributed by NM, 1-Dec-2006.)
Assertion
Ref Expression
dvdemo2 𝑥(𝑥 = 𝑦𝑧𝑥)
Distinct variable group:   𝑥,𝑧

Proof of Theorem dvdemo2
StepHypRef Expression
1 el 4807 . 2 𝑥 𝑧𝑥
2 ax-1 6 . 2 (𝑧𝑥 → (𝑥 = 𝑦𝑧𝑥))
31, 2eximii 1761 1 𝑥(𝑥 = 𝑦𝑧𝑥)
 Colors of variables: wff setvar class Syntax hints:   → wi 4  ∃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-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-pow 4803 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