[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 solixh-rec
⊦ n < # x → solixh(x, n, ixs) = solixh(x, n + 1, pushx(n, ixs, x))
Type: An axiom
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
precedesex-solixh
,
solixh-covers
,
solixh-inv
,
solixh-ordered
,
solixh-to-solitaireh
,
Used by units in proved state:
Proof exists?: No