[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 lexicographic-rec1
⊦ n ' + ar1 ≤ m ' + ar2 ↔ (n = m ⊃ ar1 ≤ ar2;n ≤ m)
Type: An axiom
Validity: The proof is valid.
Features: ls, s,
Comment:
Used by:
array-le-one-diffrent-position
,
array-le-refl
,
array-le-same-prefix
,
array-le-same-prefix2
,
array-le-swap
,
array-le-trans
,
array-neg-le-eq
,
array-neg-le-eq-2
,
ascending-order-is-min-permuted
,
descending-order-is-max-permuted
,
next-proper-permutation
,
Used by units in proved state:
Proof exists?: No