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