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

Theorem eliminable2b 35045
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
eliminable2b ({𝑥𝜑} = 𝑦 ↔ ∀𝑧(𝑧 ∈ {𝑥𝜑} ↔ 𝑧𝑦))
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧   𝜑,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem eliminable2b
StepHypRef Expression
1 dfcleq 2731 1 ({𝑥𝜑} = 𝑦 ↔ ∀𝑧(𝑧 ∈ {𝑥𝜑} ↔ 𝑧𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wal 1537   = wceq 1539  wcel 2106  {cab 2715
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-9 2116  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-cleq 2730
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator