HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem syl5eleq 1552
Description: A membership and equality inference.
Hypotheses
Ref Expression
syl5eleq.1 |- (ph -> A = B)
syl5eleq.2 |- C e. A
Assertion
Ref Expression
syl5eleq |- (ph -> C e. B)

Proof of Theorem syl5eleq
StepHypRef Expression
1 syl5eleq.2 . . 3 |- C e. A
21a1i 8 . 2 |- (ph -> C e. A)
3 syl5eleq.1 . 2 |- (ph -> A = B)
42, 3eleqtrd 1548 1 |- (ph -> C e. B)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 955   e. wcel 957
This theorem is referenced by:  syl5eleqr 1553  eqelsuc 3050  tfrlem11 3916  oalimcl 4187  omlimcl 4202
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 962  ax-17 970  ax-4 972  ax-5o 974  ax-ext 1458
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 980  df-cleq 1468  df-clel 1471
Copyright terms: Public domain