[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-subex
⊦ (∀ ty1. contains(str0, ty, ty1) → type∃(str, ty1)) ↔ (∀ class1. contains(str0, ty, mkclasstype(class1)) → tdname+∃(str, class1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 18
Used lemmas:
contains-array-elemtype-01
,
Used spec theorems:
typefuns
/
typeex-def
typefuns
/
has-classtype
typefuns
/
elemtype-base
Used simplifier rules:
javatype
/
test-28
typefuns
/
elemtype-07
javatype
/
test-09
javatype
/
elim-01
typefuns
/
elemtype-rec
javatype
/
test-10
javatype
/
elim-02
typefuns
/
jtclass
typefuns
/
typeex-class