[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-13
⊦ a ' + x = y + b ' ∧ c ∈ x ∧ c ≠ b → c ∈ y
Type: A user defined theorem
Validity: The proof is valid.
Features: inefficientacforward, forward, localforward,
Comment:
Used by:
inapp-09
,
Used by units in proved state:
list-del
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
in-12
,
e-01
,
e-02
,
app-06
,
c-05
,
app
,
lastdiv
,
inapp-08
,
c-03
,
Nil
,
in-rec
,
in-17
,
in-append
,
in-15
,
a
,
in-14
,
Used spec theorems:
Used simplifier rules: