[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 splitone-def
⊦ splitone(p, A, X) ↔ (∀ n. n ∈ p → (n < p.first + p.count ↔ A[n] ∈ X))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
NEWPARTS-theorem
,
REFINE-theorem
,
REFINEONE-theorem
,
split-init-2
,
Used by units in proved state:
Proof exists?: No