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

Theorem eqsstr3 1531
Description: Substitution of equality into a subclass relationship.
Hypotheses
Ref Expression
eqsstr3.1 |- B = A
eqsstr3.2 |- B (_ C
Assertion
Ref Expression
eqsstr3 |- A (_ C

Proof of Theorem eqsstr3
StepHypRef Expression
1 eqsstr3.1 . . 3 |- B = A
21cleqcomi 1105 . 2 |- A = B
3 eqsstr3.2 . 2 |- B (_ C
42, 3eqsstr 1530 1 |- A (_ C
Colors of variables: wff set class
Syntax hints:   = wceq 1091   (_ wss 1487
This theorem is referenced by:  inss2 1658  dmv 2546  cfom 3710  infmap2 4953  pjoml4 5497  3oa 5558
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-in 1491  df-ss 1492
metamath.org