[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 pushx-rec
⊦ pushx(n, ix ' + ixs, x) = (¬ x[ix.first] < x[n] ⊃ (n + ix) + ixs;ix + pushx(n, ixs, x))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
precedesex-pushix
,
pushix-to-push
,
pushx-cut-seq
,
pushx-inv
,
pushx-inv-gen
,
pushx-nonrec
,
pushx-ordered
,
Used by units in proved state:
Proof exists?: No