[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 Sep-range
⊦ nP ⊗_(n, m) = (λ n0. ⌜n0 < n + m⌝ → nP(n0))⊗_(n, m)
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: 6
Used lemmas:
Sep-rec
,
Sep-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
nat-basic
/
succ
nat-basic
/
s-04
nat-basic
/
l-02
heap-sep
/
true-rev
heap-sep
/
imp-proptrue