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

Theorem eliminable-abelv 37532
Description: A theorem used to prove the base case of the Eliminability Theorem (see section comment): abstraction belongs to variable. (Contributed by BJ, 30-Apr-2024.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
eliminable-abelv ({𝑥𝜑} ∈ 𝑦 ↔ ∃𝑧(∀𝑡(𝑡𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧𝑦))
Distinct variable groups:   𝑥,𝑡,𝑧   𝑦,𝑧   𝜑,𝑧,𝑡
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem eliminable-abelv
StepHypRef Expression
1 dfclel 2838 . 2 ({𝑥𝜑} ∈ 𝑦 ↔ ∃𝑧(𝑧 = {𝑥𝜑} ∧ 𝑧𝑦))
2 eliminable-veqab 37529 . . . 4 (𝑧 = {𝑥𝜑} ↔ ∀𝑡(𝑡𝑧 ↔ [𝑡 / 𝑥]𝜑))
32anbi1i 635 . . 3 ((𝑧 = {𝑥𝜑} ∧ 𝑧𝑦) ↔ (∀𝑡(𝑡𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧𝑦))
43exbii 1877 . 2 (∃𝑧(𝑧 = {𝑥𝜑} ∧ 𝑧𝑦) ↔ ∃𝑧(∀𝑡(𝑡𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧𝑦))
51, 4bitri 278 1 ({𝑥𝜑} ∈ 𝑦 ↔ ∃𝑧(∀𝑡(𝑡𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 400  wal 1567   = wceq 1569  wex 1808  [wsb 2095  wcel 2142  {cab 2740
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-clab 2741  df-cleq 2754  df-clel 2837
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator