[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-field-def-case
⊦ contains(str, ty, fs) ↔ type∃(str, ty) ∧ (∃ ty1. (ty1 ≤ ty ∧ type∃(str, ty1) ∨ contains(str, ty, ty1)) ∧ is_reftype(ty1) ∧ (is_classtype(ty1) → ¬ interface∃(str, ty1 .class) ∧ fs ' ∈ instfields(ty1 .class)) ∧ (is_arraytype(ty1) → fs ' = _length))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
contains-supertype-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 19
Proof steps: 61
Used lemmas:
contains-rec
,
contains-two
,
contains-rec-01
,
contains-type-def
,
contains-one
,
contains-field-def
,
Used spec theorems:
typefuns
/
le-noreftype-01
typefuns
/
transitivity
Used simplifier rules:
list
/javatypes/
app-02-ant
list
/javatypes/
c-08
typefuns
/
ref
list-last
/javatypes/
last-01
list
/javatypes/
e
list
/javatypes/
first
fieldspec
/
sel-03
classnamefuns
/
le-transitive
typefuns
/
reftype-class
typefuns
/
class-le
typefuns
/
typeex-class
javatype
/
test-10
javatype
/
elim-02
javatype
/
diff
typefuns
/
le-noreftype-01
fieldspec
/
elim
typefuns
/
transitivity
list-last
/javatypes/
butlast-last
list
/javatypes/
Last
list-last
/javatypes/
l-02
list-last
/javatypes/
l
list
/javatypes/
app
list
/javatypes/
a
list
/javatypes/
e-01
list
/javatypes/
c
list-data
/javatypes/
elim-list-c