ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqimssi Unicode version

Theorem eqimssi 3283
Description: Infer subclass relationship from equality. (Contributed by NM, 6-Jan-2007.)
Hypothesis
Ref Expression
eqimssi.1  |-  A  =  B
Assertion
Ref Expression
eqimssi  |-  A  C_  B

Proof of Theorem eqimssi
StepHypRef Expression
1 ssid 3247 . 2  |-  A  C_  A
2 eqimssi.1 . 2  |-  A  =  B
31, 2sseqtri 3261 1  |-  A  C_  B
Colors of variables: wff set class
Syntax hints:    = wceq 1397    C_ wss 3200
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-11 1554  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-in 3206  df-ss 3213
This theorem is referenced by:  funi  5358  fpr  5835  elfzo1  10429  sumsplitdc  11992  isumlessdc  12056  nconstwlpolem0  16667
  Copyright terms: Public domain W3C validator