[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 25 from proof sortedchars-no-dups (
previous step
)
⊦ dups(chars + chars0) ↔ dups(chars) ∨ dups(chars0) ∨ filter(chars, chars0) ≠ []
A spec-lemma