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

Theorem eleq1ab 2740
Description: Extension (in the sense of Remark 3 of the comment of df-clab 2739) of elequ1 2152 from formulas of the form "setvar setvar" to formulas of the form "setvar class abstraction". This extension does not require ax-8 2147 contrary to elequ1 2152, but recall from Remark 3 of the comment of df-clab 2739 that it can be considered an extension only because of cvjust 2754, which does require ax-8 2147.

This is an instance of eleq1w 2843 where the containing class is a class abstraction, and contrary to it, it can be proved without df-clel 2835. See also eleq1 2848 for general classes.

The straightforward yet important fact that this statement can be proved from FOL= plus df-clab 2739 (hence without ax-ext 2732, df-cleq 2752 or df-clel 2835) was stressed by Mario Carneiro. (Contributed by BJ, 17-Aug-2023.)

Assertion
Ref Expression
eleq1ab (𝑥 = 𝑦 → (𝑥 ∈ {𝑧𝜑} ↔ 𝑦 ∈ {𝑧𝜑}))

Proof of Theorem eleq1ab
StepHypRef Expression
1 sbequ 2120 . 2 (𝑥 = 𝑦 → ([𝑥 / 𝑧]𝜑 ↔ [𝑦 / 𝑧]𝜑))
2 df-clab 2739 . 2 (𝑥 ∈ {𝑧𝜑} ↔ [𝑥 / 𝑧]𝜑)
3 df-clab 2739 . 2 (𝑦 ∈ {𝑧𝜑} ↔ [𝑦 / 𝑧]𝜑)
41, 2, 33bitr4g 317 1 (𝑥 = 𝑦 → (𝑥 ∈ {𝑧𝜑} ↔ 𝑦 ∈ {𝑧𝜑}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  [wsb 2099  wcel 2145  {cab 2738
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2739
This theorem is used by:  cleljustab  2741  ralab2  3654  rexab2  3656
  Copyright terms: Public domain W3C validator