[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 1 from proof keyset-overwrite-add (conclusion)
m ≤ # kar ⊦ n < m → keyset(kar[n, ki], m) ++ kar[n] = keyset(kar, m) ++ ki
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n < m, m ≤ # kar ⊦ keyset(kar[n, ki], m) ++ kar[n] = keyset(kar, m) ++ ki
Rule argument
Additional information