[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 in-06
⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
in
,
in-01
,
in-07
,
in-08
,
in-14
,
in-append0-not-left
,
inapp
,
inapp-03
,
neq-01
,
neq-07
,
Used by units in proved state:
list-del
,
olist-min-max
,
olist
,
list-setequal
,
list-perm
,
list-set
,
path-reachable
,
list-dup
,
list-last
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
a
,
in-17
,
in-append
,
Used spec theorems:
Used simplifier rules: