[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
,
Theorem eq-add2n-1-eq-le
⊦ n = n0 + n1 + 1 ∧ n0 + n1 = m0 + m1 → (n < m0 ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
Used spec theorems:
nat-basic
/
addex
Used simplifier rules:
nat-basic
/
f
nat-basic
/
eq-01
nat-basic
/
eq-02
nat-basic
/
oz
nat-basic
/
a
nat-basic
/
c