[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 del-lists-unions
⊦ H0 ⊥ H1 ∧ del-list(rx, n)(H0) → (((del-list(rx, m) * P))(H0 ∪ H1) ↔ n = m ∧ P(H1))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 32
Used lemmas:
ex-p
,
ex
,
del-list-rec
,
del-list-base
,
Used spec theorems:
heap-sep
/
sep
heap
/cell-heap/
uni-ass
linked-list
/
ls-union
heap
/cell-heap/
disj-distr-uni
Used simplifier rules:
heap-sep
/
emp-sep
heap-sep
/
emp
heap
/cell-heap/
uni-emp-l
list
/reflist/
c
nat
/
elim-sub
heap-sep
/
prop
heap-sep
/
and
heap-sep
/
and-com
heap-sep
/
and-ass
heap-sep
/
prop-shift
nat
/
ge
heap
/cell-heap/
disj-distr-uni-com
heap-sep
/
sep-ass
nat-basic
/
eq-01
heap
/cell-heap/
disj-com-rw
heap-sep
/
sep-com
nat
/
eq-01
nat-basic
/
c
nat-basic
/
a
nat
/
lep