[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem contains-trans-01
⊦ contains(str, ty ' + tys + ty0 ') ∧ contains(str, ty0 ' + tys0 + ty1 ') → contains(str, ty ' + tys + ty0 ' + tys0 + ty1 ')
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
contains-trans
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 25
Used lemmas:
contains-rec
,
contains-rec-01
,
Used spec theorems:
list
/javatypes/
firsteq-01
Used simplifier rules:
list
/javatypes/
len
list
/javatypes/
len-02
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
list
/javatypes/
e-01
list
/javatypes/
in-08
list
/javatypes/
fr
list
/javatypes/
Nil
list
/javatypes/
c-03
fieldspec
/
sel-03
typefuns
/
reftype-class
typefuns
/
typeex-class
typefuns
/
class-le
javatype
/
test-10
javatype
/
elim-02
javatype
/
diff
fieldspec
/
elim
list
/javatypes/
in-17
list
/javatypes/
in-append
list
/javatypes/
in-14
list
/javatypes/
in-15
list
/javatypes/
c
list-data
/javatypes/
elim-list-c
list
/javatypes/
first-02
list
/javatypes/
e-02
list
/javatypes/
app-02-ant
list
/javatypes/
e
list
/javatypes/
a