[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 3 from proof size-rec-rem (
previous step
)
adr = @(m, m0, m1) ⊦ (as ++ adr).size = (as.size - (adr ∈ as ⊃ m1;0)) + m1
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
⊦ (as ++ @(m, m0, m1)).size = (as.size - (@(m, m0, m1) ∈ as ⊃ m1;0)) + m1
Rule argument
Additional information