[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-insert
⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st
Type: An axiom
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Data-in-putsame
,
del-exists
,
del-put
,
del-putsame
,
delete-put-rew
,
dom-ins
,
empty
,
eq-shift-put
,
exin
,
exputin
,
in-neq
,
indef
,
indef-01
,
inex
,
inj-put
,
ins
,
ins-same
,
ins-same-01
,
ins3
,
insin
,
insins
,
neq
,
notmemlookup
,
put-neq
,
rew
,
subset-put
,
subset-put-01
,
subset-put-strong-03
,
subset-put-strong-04
,
subset-put-strong-05
,
Used by units in proved state:
Proof exists?: No