Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eliminable3b Structured version   Visualization version   GIF version

Theorem eliminable3b 34975
Description: A theorem used to prove the base case of the Eliminability Theorem (see section comment). (Contributed by BJ, 19-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
eliminable3b ({𝑥𝜑} ∈ {𝑦𝜓} ↔ ∃𝑧(𝑧 = {𝑥𝜑} ∧ 𝑧 ∈ {𝑦𝜓}))
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧   𝜑,𝑧   𝜓,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem eliminable3b
StepHypRef Expression
1 dfclel 2818 1 ({𝑥𝜑} ∈ {𝑦𝜓} ↔ ∃𝑧(𝑧 = {𝑥𝜑} ∧ 𝑧 ∈ {𝑦𝜓}))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395   = wceq 1539  wex 1783  wcel 2108  {cab 2715
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110
This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1784  df-clel 2817
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator