[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-init
⊦ # A ≠ 0 → Inv-main(A, A, 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
pair-insertion-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
Inv-main
,
Used spec theorems:
Used simplifier rules:
oarray-perm
/
perm-ident
oarray-sorted
/
sorted-emtpy
nat
/
lez