[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 del1-n
⊦ a ≠ b → (b ' + x) -1l a = b ' + (x -1l a)
Type: An axiom
Validity: The proof is valid.
Features: localcut, simp, localsimp,
Comment:
Used by:
app
,
app-01
,
del-del1-nodups
,
del-del1-switch
,
del1-del
,
del1-del-switch
,
del1-empty
,
delete-one-nls
,
dups
,
dups-01
,
in-01-01
,
in-02-01
,
in-04
,
l
,
l-02
,
one-01-01
,
put-del1-in
,
put-in-01
,
rmdup-del1-del
,
sw-02
,
Used by units in proved state:
olist-sort
,
olist
,
list-perm
,
Proof exists?: No