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

Theorem elabgf 3500
Description: Membership in a class abstraction, using implicit substitution. Compare Theorem 6.13 of [Quine] p. 44. This version has bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.) (Revised by Mario Carneiro, 12-Oct-2016.)
Hypotheses
Ref Expression
elabgf.1 𝑥𝐴
elabgf.2 𝑥𝜓
elabgf.3 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
elabgf (𝐴𝐵 → (𝐴 ∈ {𝑥𝜑} ↔ 𝜓))

Proof of Theorem elabgf
StepHypRef Expression
1 elabgf.1 . 2 𝑥𝐴
2 nfab1 2915 . . . 4 𝑥{𝑥𝜑}
31, 2nfel 2926 . . 3 𝑥 𝐴 ∈ {𝑥𝜑}
4 elabgf.2 . . 3 𝑥𝜓
53, 4nfbi 1985 . 2 𝑥(𝐴 ∈ {𝑥𝜑} ↔ 𝜓)
6 eleq1 2838 . . 3 (𝑥 = 𝐴 → (𝑥 ∈ {𝑥𝜑} ↔ 𝐴 ∈ {𝑥𝜑}))
7 elabgf.3 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
86, 7bibi12d 334 . 2 (𝑥 = 𝐴 → ((𝑥 ∈ {𝑥𝜑} ↔ 𝜑) ↔ (𝐴 ∈ {𝑥𝜑} ↔ 𝜓)))
9 abid 2759 . 2 (𝑥 ∈ {𝑥𝜑} ↔ 𝜑)
101, 5, 8, 9vtoclgf 3416 1 (𝐴𝐵 → (𝐴 ∈ {𝑥𝜑} ↔ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1631  wnf 1856  wcel 2145  {cab 2757  wnfc 2900
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 829  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-v 3353
This theorem is referenced by:  elabf  3501  elabg  3503  elab3gf  3508  elrabf  3512
  Copyright terms: Public domain W3C validator