Theorem eleq12i 2853

Description: Inference from equality to equivalence of membership. (Contributed by NM, 31-May-1994.)

Hypotheses

Ref	Expression
eleq1i.1	⊢ 𝐴 = 𝐵
eleq12i.2	⊢ 𝐶 = 𝐷

Assertion

Ref	Expression
eleq12i	⊢ (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)

Proof of Theorem eleq12i

Step	Hyp	Ref	Expression
1		eleq12i.2	. . 3 ⊢ 𝐶 = 𝐷
2	1	eleq2i 2852	. 2 ⊢ (𝐴 ∈ 𝐶 ↔ 𝐴 ∈ 𝐷)
3		eleq1i.1	. . 3 ⊢ 𝐴 = 𝐵
4	3	eleq1i 2851	. 2 ⊢ (𝐴 ∈ 𝐷 ↔ 𝐵 ∈ 𝐷)
5	2, 4	bitri 278	1 ⊢ (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)

This proof depends on syntax axioms:   ↔ wb 209   = 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:  sbcel12  4369  smndex1n0mnd  19025  zclmncvs  25377  gausslemma2dlem4  27606  bnj98  35377  elmpst  36116  elmpps  36153  sbceqbii  36812  cbvsbcvw2  36851  oaordnrex  44137  omnord1ex  44146  oenord1ex  44157  wfaxpow  45821  unirnmapsn  46045  gpgprismgr4cycllem8  49019  isprmrng  49252