[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 ran-put-new
⊦ ¬ r0 ∈ map → ran map[r0, r1] = ran map ++ r1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
copy
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
ran
,
Used spec theorems:
set-basic
/refset/
Extension
store+set
/ref-map-store+set-r/
Data-in
Used simplifier rules:
store+set
/ref-map-store+set-r/
Data-in-putsame
store+set
/ref-map-store+set-r/
Data-notin-other
set-basic
/refset/
rax
store
/ref-map/
At-in-out
store
/ref-map/
In-insert