[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
⊦ disj(asar, n, m) ↔ (∀ n0, n1. n0 < m ∧ n1 < m ∧ n0 ≠ n1 → asar[n + n0] ∩ asar[n + n1] = ∅)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
disj-in-both
,
disj-rec
,
disj-write
,
Used by units in proved state:
Proof exists?: No