Theorem 3sstr3g 3999

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 3986	. 2 ⊢ (𝜑 → 𝐶 ⊆ 𝐵)
4		3sstr3g.3	. 2 ⊢ 𝐵 = 𝐷
5	3, 4	sseqtrdi 3987	1 ⊢ (𝜑 → 𝐶 ⊆ 𝐷)

Syntax hints:   → wi 4   = wceq 1540   ⊆ wss 3914

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1780  df-cleq 2721  df-ss 3931

This theorem is referenced by:  complss  4114  uniintsn  4949  fpwwe2lem12  10595  hmeocls  23655  hmeontr  23656  usgrumgruspgr  29109  chsscon3i  31390  pjss1coi  32092  mdslmd2i  32259  satffunlem2lem2  35393  ssbnd  37782  bnd2lem  37785  trclubgNEW  43607  nzss  44306