[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-weak-conjunction
((nP ⊗_(n, m) * hP))(h) ⊦ ∀ n0. n0 < m → ((nP(n + n0) * hP * true))(h)
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: 1
Proof steps: 2
Used lemmas:
Sep-unfold
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
heap-sep
/
true-elim
heap-sep
/
sep-ass
heap-sep
/
sep-com