[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
,
Proof step 24 from proof range-write-in (
previous step
)
key ∈ ri, ∀ key0, key1. key0 ∈ ri ∧ key1 ∈ ri ∧ ri[key0] = ri[key1] → key0 = key1 ⊦ ∃ key0. key0 ∈ ri[key, adr] ∧ ri[key, adr][key0] = adr
Heuristic quantifier closing applied rule exists right
And closed the goal!
Rule argument
pos: right 1 terms: key
Additional information
Used simplifier rules: ⊦ key ∈ ri[key, adr]; (s)% ⊦ ri[key, adr][key] = adr; (s) Used terms: key