[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 1 from proof no-dups-idx-mvlast (conclusion)
⊦ m < # kar ∧ no-dups-idx(kar, m + 1) ∧ kar[m] = ki → no-dups-idx(kar[m0, ki], m)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
kar[m] = ki, m < # kar, no-dups-idx(kar, m + 1) ⊦ no-dups-idx(kar[m0, ki], m)
Rule argument
Additional information