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

Theorem syl5eleq 1554
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 1550 1 |- (ph -> C e. B)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 956   e. wcel 958
This theorem is referenced by:  syl5eleqr 1555  eqelsuc 3054  tfrlem11 3921  oalimcl 4194  omlimcl 4209
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-17 971  ax-4 973  ax-5o 975  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-cleq 1469  df-clel 1472
Copyright terms: Public domain