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 1570   ∈ wcel 2145

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  ax-8 2147  ax-9 2155  ax-ext 2732

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

This theorem is used by:  eleqtrrid  2867  opth1  5451  opth  5452  eqelsuc  6444  tfrlem11  8378  oalimcl  8548  omlimcl  8566  frgp0  19888  txdis  23859  ordtconnlem1  34435  rankeq1o  36752  preel  39249  fourierdlem48  46983