Theorem sseq1d 3299

Description: An equality deduction for the subclass relationship. (Contributed by NM, 14-Aug-1994.)

Hypothesis

Ref	Expression
sseq1d.1	|- (ph -> A = B)

Assertion

Ref	Expression
sseq1d	|- (ph -> (A C_ C <-> B C_ C))

Proof of Theorem sseq1d

Step	Hyp	Ref	Expression
1		sseq1d.1	. 2 |- (ph -> A = B)
2		sseq1 3293	. 2 |- (A = B -> (A C_ C <-> B C_ C))
3	1, 2	syl 15	1 |- (ph -> (A C_ C <-> B C_ C))

Syntax hints:   -> wi 4   <-> wb 176   = wceq 1642   C_ wss 3258

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-ss 3260

This theorem is referenced by:  sseq12d  3301  eqsstrd  3306  snssg  3845  ssiun2s  4011  elp6  4264  iotassuni  4356  dmxpss  5053  funimass1  5170  feq1  5211  fvimacnvi  5403  fvmptss  5706  clos1eq2  5876  mapsspw  6023  map0e  6024  sbthlem1  6204