[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 11 from proof prime-product (
previous step
)
⊦ ∃ ints0, ints1. perm(ints, ints0 + ints1) ∧ (ints0 = [] ∨ max(ints0) ≤ j) ∧ (ints1 = [] ∨ j < min(ints1))
A spec-lemma