[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 8 from proof in-keyrange-in-ri (
previous step
)
key ∈ (nused = 1 ⊃ ri;ri |≤ zbrar[0].key), nused ≤ # zbrar ⊦ # zbrar = 0, nused = 0, key ∈ ri
User applied rule case distinction
And closed the goal!
Rule argument
pos: left 1
Additional information
Used simplifier rules: ⊦ key0 ∈ ri |≤ key1 ↔ key0 ∈ ri ∧ ¬ key1 < key0; (s)