[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 21 from proof del-commute-dels (
previous step
)
⊦ key0 ∈ (ri ⊖ key) ⊖ ks ↔ key0 ∈ (ri ⊖ ks) ⊖ key, key ∈ ks, (key0 ∈ (ri ⊖ key) ⊖ ks ↔ key0 ∈ (ri ⊖ ks) ⊖ key) ∧ (key0 ∈ (ri ⊖ key) ⊖ ks → ((ri ⊖ key) ⊖ ks)[key0] = ((ri ⊖ ks) ⊖ key)[key0])
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 22
:
⊦ key0 ∈ (ri ⊖ key) ⊖ ks ↔ key0 ∈ (ri ⊖ ks) ⊖ key, key ∈ ks
Rule argument
Additional information