[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 moveAndFill
moveAndFill#(m, m0, n, a; ar) {ar := move(ar, m, m0, n); if m ≤ n then if m + n < m0 then ar := fill(ar, a, m, n) else ar := fill(ar, a, m, m0) else if m + n < m + m - m0 then ar := fill(ar, a, m, n) else ar := fill(ar, a, m, m0) }
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: No