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