[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-forall-reduce-true
⊦ (∀ n0, P. n0 < m ∧ ((nP(n + n0) * P))(zh) → ((nP2(n + n0) * true * P))(zh)) ∧ ((nP ⊗_(n, m) * P0))(zh) → ((nP2 ⊗_(n, m) * true * P0))(zh)
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: 5
Proof steps: 12
Used lemmas:
Used spec theorems:
iter-n
/zheap/
Sep-unfold
Used simplifier rules:
heap-sep
/zheap/
true-emp
nat-basic
/
succ
heap-sep
/zheap/
emp-sep
iter-n
/zheap/
Sep-base
nat
/
eq-01
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
oelem
/nat-set/
irreflexivity
nat-basic
/
f
heap-sep
/zheap/
true-true
heap-sep
/zheap/
true-elim
heap-sep
/zheap/
sep-com
heap-sep
/zheap/
sep-ass
nat-basic
/
ls-02