[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 eq-01
⊦ x + a ' + b ' + y + c ' + z = x0 + a ' + c ' + z0 ∧ ¬ a ∈ y ∧ a ≠ b ∧ b ≠ c → dups(x + a ' + c ' + z)
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: 5
Proof steps: 14
Used lemmas:
rec
,
f-01
,
Used spec theorems:
list
/
firsteq
Used simplifier rules:
list
/
in-empty
list
/
app-08
list
/
in-11
list
/
neq-01
list
/
c-06
list
/
in-01
list
/
in-14
list
/
in-append
list
/
in-06
list
/
app-02-ant
list
/
first-02
list
/
e-02
list
/
first-app
list
/
Nil
list
/
inapp-02
list-data
/
elim-list-c
list
/
in-rec
list
/
c-08
list
/
e-01
list
/
c-07
list
/
c
list
/
a