[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 And-forall
∀ a, h. a ∈ st ∧ adP0(a, st[a])(h) → adP(a, st[a])(h) ⊦ ((adP0 ∧_ st))(h) → ((adP ∧_ st))(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: 6
Proof steps: 12
Used lemmas:
And-ins
,
And-emp
,
Used spec theorems:
store
/
exnotempty
Used simplifier rules:
heap-sep
/
trueH
heap-sep
/
and-com
heap-sep
/
and-ass
heap-sep
/
and
store
/
At-same
store
/
insin
store
/
Size-insert
nat-basic
/
s-04
nat-basic
/
refl-nat
nat-basic
/
a
nat-basic
/
c
store
/
At-in-out
store
/
In-insert