[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 6 from proof to-ards-no-dups (
previous step
)
dups(lax0), ∀ n. dups(lax0.to-adr(n)) ↔ dups(lax0) ⊦ @(n, m, m0) ∈ lax0.to-adr(n) ∨ dups(lax0.to-adr(n)) ↔ @(m, m0) ∈ lax0 ∨ dups(lax0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
dups(lax0), ∀ n0. dups(lax0.to-adr(n0)) ⊦ dups(lax0.to-adr(n)), @(n, m, m0) ∈ lax0.to-adr(n)
Rule argument
Additional information