[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 7 from proof restrict-union (
previous step
)
adr = @(m, m0, m1) ⊦ m = n ∧ adr ∈ as0 ∪ as1 ↔ adr ∈ (as0 | n) ∪ (as1 | n)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 8
:
⊦ m = n ∧ @(n, m0, m1) ∈ as0 ∪ as1 ↔ @(m, m0, m1) ∈ (as0 | n) ∪ (as1 | n)
Rule argument
Additional information