[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 count-entries
∀ str. str ∈ entries ↔ str ∈ sdt ⊦ # entries = # sdt
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: 10
Proof steps: 17
Used lemmas:
Used spec theorems:
directory-tree-base
/
Extension
store
/dir-entries/
exnotempty
store
/directory-tree-inst/
exin
store
/dir-entries/
In-insert
directory-tree-base
/
In-insert
Used simplifier rules:
store
/dir-entries/
In-empty
store
/directory-tree-inst/
empty
store
/dir-entries/
Size-empty
directory-tree-inst
/
read-notin
directory-tree-base
/
In-empty
store
/dir-entries/
In-insert
store
/dir-entries/
insin
nat-basic
/
eq-01
directory-tree-base
/
Size-insert
store
/dir-entries/
Size-insert
nat-basic
/
s-04
oelem
/nat-set/
irreflexivity
nat-basic
/
a
nat-basic
/
c