[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 8 from proof lebs-write (
previous step
)
∃ adr. adr.lnum = n ∧ adr ∈ ri[key, @(m, m0, m1)] ⊦ n = m, key ∈ ri, ∃ adr. adr.lnum = n ∧ adr ∈ ri
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 9
:
adr ∈ ri[key, @(m, m0, m1)] ⊦ adr.lnum = m, key ∈ ri, ∃ adr0. adr0.lnum = adr.lnum ∧ adr0 ∈ ri
Rule argument
Additional information