[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 Idexcept-n
⊦ id○(ar0, ar1, m, n) ↔ # ar0 = # ar1 ∧ m + n ≤ # ar0 ∧ (∀ m0. (m0 < m ∨ m + n ≤ m0) ∧ m0 < # ar0 → ar0[m0] = ar1[m0])
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
idexcept-eq-above
,
idexcept-eq-below
,
idexcept-n-copy-other
,
idexcept-n-fill-other
,
idexcept-n-same
,
idexcept-n-shorter
,
idexcept-n-subarrays
,
idexcept-n-trans
,
idexcept-n-trans-rev
,
idexcept-n-trans-successive
,
idexcept-n-widden
,
idexcpt-n-copy-hole
,
Used by units in proved state:
Proof exists?: No