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