[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 two-loup-11
⊦ m < n → ((m + n) / 2 < m + 1 ↔ m + 1 = n)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
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: 4
Used lemmas:
div-elim
,
two-mdiv2-03
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
succ-03
nat
/
lels
nat-basic1
/
ref-1
nat-mult
/
two-02
nat-basic2
/
s
nat-basic1
/
f
nat
/
fle-01
nat-basic1
/
twols-02
nat-mult
/
twoeqf-02
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic2
/
a
nat-basic2
/
c
nat
/
anti
nat-basic1
/
lf-02
nat-mult
/
numeral-19
nat-mult
/
one
nat-basic2
/
add-base
nat-mult
/
twoeqf
nat
/
le-ls-simp