[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 eval-nonexisting-path
r0 ∈ H, closed(H), ¬(∃ r1. path(x, r0, r1, H)) ⊦ ⟪eval#(r0, x, H; a?)⟫ (a? = none)
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: 0
Proof steps: 20
Used lemmas:
eval
,
Used spec theorems:
Used simplifier rules:
elem-option
/
disj
functions
/
path-emp
list-data
/
elim-list-c
functions
/
path-rec
list
/
e-01
node
/
elim
list
/
c
list
/
len
list
/
len-02
list
/
a
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
functions
/
path-first-in
functions
/
path-last-in
functions
/
closed-succ