[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 startorfin-reset (
previous step
)
⊦ startorfin(p, P0) ↔ (∃ p0. p0 ∈ P0 ∧ (p0.first = p.first ∧ p.last ≤ p0.last ∨ p0.first ≤ p.first ∧ p0.last = p.last))
Lemma
startorfin-def