[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 linearity-path
path(r ' + x, H), path(r ' + y, H) ⊦ x = y ∨ (∃ r0, y0. x = y + r0 ' + y0) ∨ (∃ r0, x0. y = x + r0 ' + x0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
acyclic-rem-not-reachable
,
rem-stays-reachable-aux1
,
rem-stays-reachable-aux2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 18
Used lemmas:
path-cons
,
path-one
,
Used spec theorems:
Used simplifier rules:
list
/reflist/
e-03
list
/reflist/
Nil
list
/reflist/
app
list
/reflist/
c-06
list
/reflist/
c
list
/reflist/
app-01
list
/reflist/
a
list
/reflist/
e-01
list
/reflist/
app-04