Theorem 3sstr3d 2103

Description: Substitution of equality into both sides of a subclass relationship.

Hypotheses

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

Assertion

Ref	Expression
3sstr3d	|- (ph -> C (_ D)

Proof of Theorem 3sstr3d

Step	Hyp	Ref	Expression
1		3sstr3d.1	. 2 |- (ph -> A (_ B)
2		3sstr3d.2	. . 3 |- (ph -> A = C)
3		3sstr3d.3	. . 3 |- (ph -> B = D)
4	2, 3	sseq12d 2090	. 2 |- (ph -> (A (_ B <-> C (_ D))
5	1, 4	mpbid 195	1 |- (ph -> C (_ D)

Syntax hints:   -> wi 3   = wceq 956   (_ wss 2047

This theorem is referenced by:  shlej2t 9356  pjspansnt 9500

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-in 2051  df-ss 2053

Copyright terms: Public domain