[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
,
Proof step 23 from proof theoremx-atleast (conclusion)
⊦ ∃ ix. # ix = # solix(x) ∧ ascsubseq(ix, x)
User applied rule insert lemma
And obtained the following new goals
Proof step 1
:
⊦ precedes∃(solix(x), x)
Rule argument
spec: inst: name:precedesex-solix seq: ⊦ precedes∃(solix(x), x) subst:[x] → [x] flags:current, []
Additional information
[Concretesimprules(()), Extraterms((x))]