[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 key-in-update-index (conclusion)
⊦ # kx = # ax → (key ∈ ri[kx, ax] ↔ key ∈ ri ∨ key ∈ kx)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
# kx = # ax ⊦ key ∈ ri[kx, ax] ↔ key ∈ ri ∨ key ∈ kx
Rule argument
Additional information