[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 inapp
⊦ a ' + x + b ' = y + c ' + c ' + z ∧ a ≠ b ∧ ¬ a ∈ x ∧ ¬ b ∈ x → dups(x)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
list-dup
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
f-01
,
Used spec theorems:
list
/
lastdiv
list
/
firsteq
Used simplifier rules:
list
/
in-10
list
/
inapp-11
list
/
inapp-02
list
/
isin-01
list
/
app
list
/
in-01
list
/
in-11
list
/
in-14
list
/
in-17
list
/
in-append
list
/
e-02
list
/
app-06
list
/
in-15
list
/
in-08
list
/
in-rec
list
/
a
list
/
Nil
list
/
c-06