Theorem sseq12i 3170

Description: An equality inference for the subclass relationship. (Contributed by NM, 31-May-1999.) (Proof shortened by Eric Schmidt, 26-Jan-2007.)

Hypotheses

Ref	Expression
sseq1i.1	⊢ 𝐴 = 𝐵
sseq12i.2	⊢ 𝐶 = 𝐷

Assertion

Ref	Expression
sseq12i	⊢ (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)

Proof of Theorem sseq12i

Step	Hyp	Ref	Expression
1		sseq1i.1	. 2 ⊢ 𝐴 = 𝐵
2		sseq12i.2	. 2 ⊢ 𝐶 = 𝐷
3		sseq12 3167	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷))
4	1, 2, 3	mp2an 423	1 ⊢ (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)

Syntax hints:   ↔ wb 104   = wceq 1343   ⊆ wss 3116

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-11 1494  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-in 3122  df-ss 3129

This theorem is referenced by:  3sstr3i  3182  3sstr4i  3183  3sstr3g  3184  3sstr4g  3185  ss2rab  3218