Theorem sseqtr4d 1537

Description: Substitution of equality into a subclass relationship.

Hypotheses

Ref	Expression
sseqtr4d.1	|- (ph -> A (_ B)
sseqtr4d.2	|- (ph -> C = B)

Assertion

Ref	Expression
sseqtr4d	|- (ph -> A (_ C)

Proof of Theorem sseqtr4d

Step	Hyp	Ref	Expression
1		sseqtr4d.1	. 2 |- (ph -> A (_ B)
2		sseqtr4d.2	. . 3 |- (ph -> C = B)
3	2	cleqcomd 1106	. 2 |- (ph -> B = C)
4	1, 3	sseqtrd 1536	1 |- (ph -> A (_ C)

Syntax hints:   -> wi 2   = wceq 1091   (_ wss 1487

This theorem is referenced by:  oaordi 3148  omordi 3164  oen0 3165  rankr1id 3539  cflim 3704  ssmd2 5735  atexch 5769

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