[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 Inv-end
⊦ Inv-end(A, A0, i, j, y) ↔ # A ≠ 0 ∧ # A = # A0 ∧ j ≤ i ∧ (j ≠ i → y ≤ A[j + 1]) ∧ sorted(A, 0, (j = i ⊃ i;i + 1)) ∧ perm(A[j, y], A0)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
Inv-end-init
,
Inv-end-j-le-i
,
Inv-end-reduce
,
Inv-end-size-eq
,
Used by units in proved state:
pair-insertion-sort
,
Proof exists?: No