Theorem eleqtrid 2866

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 2862	1 ⊢ (𝜑 → 𝐴 ∈ 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-cleq 2752  df-clel 2835

This theorem is used by:  eleqtrrid  2867  opth1  5444  opth  5445  eqelsuc  6452  tfrlem11  8404  oalimcl  8576  omlimcl  8594  frgp0  19983  txdis  23960  ordtconnlem1  34606  rankeq1o  37056  preel  39569  fourierdlem48  47300