[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 hesselink-cons
⊦ p ⊑ q ∧ p ≠ q ∧ q ∈ root → p ∈ root ∧ root[p].dir?
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: 4
Proof steps: 8
Used lemmas:
Used spec theorems:
list
/path/
lastdiv-rew
Used simplifier rules:
list-last
/path/
prefix-empty
directory-tree
/
split-in
list
/path/
app-04
list
/path/
e
list
/path/
a
list-last
/path/
prefix-app-05
directory-tree
/
notdir-notin
list-last
/path/
prefix-attach
list
/path/
len
list
/path/
len-02
nat-basic
/
s-04
nat-basic
/
ref
nat-basic
/
a
nat-basic
/
c