[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 in-union-ext
⊦ adr ∈ union(asar, n, m) ↔ (∃ n0. n ≤ n0 ∧ n0 < n + m ∧ adr ∈ asar[n0])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
in-index-in-union-1
,
union-write
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
union-rec
,
union-base
,
Used spec theorems:
Used simplifier rules:
set-basic
/address-list-set/
In-empty
nat-basic
/
add-base
nat
/
le-ls-simp
nat-basic
/
s-04
nat-basic
/
succ
set-union
/address-list-set/
unin
nat-basic
/
l
nat-basic
/
ref
nat-basic
/
l-01
nat
/
fle-01
nat-basic
/
f
nat-basic
/
ls-02
set-basic
/address-list-set/
size-zero-01
nat-basic
/
c
nat-basic
/
a
nat
/
lep
nat
/
let
set-basic
/address-list-set/
ne-01
set-union
/address-list-set/
unc
set-union
/address-list-set/
una
set-union
/address-list-set/
unin-01
nat
/
lels
nat
/
anti