[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 unique-root
⊦ rooted(g) ∧ isroot(g)(a) ∧ isroot(g)(b) → a = b
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: 15
Proof steps: 35
Used lemmas:
rooted-def
,
Used spec theorems:
infgraph-gen
/
isroot-def
infgraph-gen
/
path-def
list-last
/
l-02
infgraph-gen
/
pathp-def
Used simplifier rules:
list-data
/
elim-list-c
list
/
c
list
/
a
stream
/
append-finfin
list
/
e-01
list-last
/
last-one
list
/
app
stream
/
append-assoc
stream
/
append-empty
stream
/
empty
list-last
/
last-elim
list
/
e-02
stream
/
get-append3-fin
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
ls-natinf-to-nat-1-2
nat-basic
/
c
nat-basic
/
a
nat-inf
/
num-add
list
/
len-02
stream
/
size-fin
stream
/
size-append
stream
/
get-append2-fin
stream
/
get-cons-succ
nat-inf
/
less-fin
nat-inf
/
less-succ-leq
nat-inf
/
add-ls-cancel-num-04
nat-inf
/
add-fin
list-del
/
get-last-03
list-del
/
get-last-04
nat-basic
/
ref
list-last
/
l-02