[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 5 from proof ri-inj-del (
previous step
)
ri[key0] = ri[key1], key0 ∈ ri, key1 ∈ ri, ∀ key0, key1. key0 ∈ ri ∧ key1 ∈ ri ∧ ri[key0] = ri[key1] → key0 = key1 ⊦ key0 = key1, key0 = key, key1 = key
Heuristic quantifier applied rule all left
And closed the goal!
Rule argument
pos: left 4 terms: key0, key1
Additional information
Used terms: key0, key1