[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 Uniform-heap
¬ null ∈ h, hP(∅), ∀ h, r. ¬ null ∈ h → hP(h) → hP(h +h r), ∀ h, r, o. ¬ null ∈ h → hP(h) → hP(h[r := o]h) ⊦ hP(h)
Type: A proof obligation
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: 9
Proof steps: 16
Used lemmas:
Used spec theorems:
map
/
Extension
map
/
notmemlookup
map
/
exin
heapmap
/
put-def
Used simplifier rules:
map
/
In-empty
map
/
In-insert
heapmap
/
add-in
map
/
Size-insert
nat-basic
/
s-04
nat-basic
/
refl-Nat
nat-basic
/
a
nat-basic
/
c
heapmap
/
add-update-is-alloc
heapmap
/
put-undef