[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 bertrand-prime-factors (
previous step
)
ordered≤(ints) ⊦ ∃ ints0, ints1. ints = ints0 + ints1 ∧ (∀ i. i ∈ ints0 → i < i0 ∨ i = i0) ∧ (∀ i. i ∈ ints1 → i0 < i)
A spec-lemma