[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 disj-write
m ≤ # asar, n < m ⊦ disj(asar, 0, m) → (disj(asar[n, as], 0, m) ↔ (∀ n0. n0 ≠ n ∧ n0 < m → asar[n0] ∩ as = ∅))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 19
Used lemmas:
disj
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
fle
set-union
/address-list-set/
int-c
array
/address-set-array/
Put-other
set-basic
/address-list-set/
size-zero-01
set-basic
/address-list-set/
size-zero
array
/address-set-array/
Put-same