[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 10 from proof lookup-range-rem-union (
previous step
)
(∃ key. key ∈ ks ∧ key ∈ ri ∧ adr = ri[key]) ∨ (∃ key. key ∈ ri \ ks ∧ (ri \ ks)[key] = adr) ⊦ adr ∈ ri
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 11
:
key ∈ ks ∧ key ∈ ri ∧ adr = ri[key] ∨ key0 ∈ ri \ ks ∧ (ri \ ks)[key0] = adr ⊦ adr ∈ ri
Rule argument
Additional information