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