Theorem 3sstr3g 3983

Description: Substitution of equality into both sides of a subclass relationship. (Contributed by NM, 1-Oct-2000.)

Hypotheses

Ref	Expression
3sstr3g.1	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
3sstr3g.2	⊢ 𝐴 = 𝐶
3sstr3g.3	⊢ 𝐵 = 𝐷

Assertion

Ref	Expression
3sstr3g	⊢ (𝜑 → 𝐶 ⊆ 𝐷)

Proof of Theorem 3sstr3g

Step	Hyp	Ref	Expression
1		3sstr3g.2	. . 3 ⊢ 𝐴 = 𝐶
2		3sstr3g.1	. . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
3	1, 2	eqsstrrid 3970	. 2 ⊢ (𝜑 → 𝐶 ⊆ 𝐵)
4		3sstr3g.3	. 2 ⊢ 𝐵 = 𝐷
5	3, 4	sseqtrdi 3971	1 ⊢ (𝜑 → 𝐶 ⊆ 𝐷)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ⊆ wss 3899

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2752  df-ss 3916

This theorem is used by:  complss  4098  uniintsn  4945  fpwwe2lem12  10676  hmeocls  24026  hmeontr  24027  usgrumgruspgr  29674  chsscon3i  31974  pjss1coi  32676  mdslmd2i  32843  satffunlem2lem2  36068  ssbnd  38603  bnd2lem  38606  trclubgNEW  44523  nzss  45206