Theorem eleqtrid 2869

Description: A membership and equality inference. (Contributed by NM, 4-Jan-2006.)

Hypotheses

Ref	Expression
eleqtrid.1	⊢ 𝐴 ∈ 𝐵
eleqtrid.2	⊢ (𝜑 → 𝐵 = 𝐶)

Assertion

Ref	Expression
eleqtrid	⊢ (𝜑 → 𝐴 ∈ 𝐶)

Proof of Theorem eleqtrid

Step	Hyp	Ref	Expression
1		eleqtrid.1	. . 3 ⊢ 𝐴 ∈ 𝐵
2	1	a1i 11	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
3		eleqtrid.2	. 2 ⊢ (𝜑 → 𝐵 = 𝐶)
4	2, 3	eleqtrd 2865	1 ⊢ (𝜑 → 𝐴 ∈ 𝐶)

Syntax hints:   → wi 4   = wceq 1570   ∈ wcel 2143

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-cleq 2755  df-clel 2838

This theorem is referenced by:  eleqtrrid  2870  opth1  5457  opth  5458  eqelsuc  6447  tfrlem11  8371  oalimcl  8541  omlimcl  8559  frgp0  19825  txdis  23789  ordtconnlem1  34314  rankeq1o  36663  preel  39169  fourierdlem48  46888