[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 max-rev
⊦ maxenc(m0, m) = n ∧ (m0 * (m0 + 1)) / 2 ≤ m → (n * (n + 1)) / 2 ≤ m ∧ m < ((n + 1) * (n + 2)) / 2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max-rev-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 8
Used lemmas:
max-def
,
maxi-rec
,
Used spec theorems:
nat-mult
/
dist
nat-div
/
div-add
Used simplifier rules:
nat-div
/
mod-mult
nat-div
/
two-mdiv2-02
nat
/
le-ls-simp
nat-mult
/
succ
nat-div
/
le-div-to-mult
nat-basic2
/
eq-01
nat
/
eq-02
nat
/
let
nat
/
fle
nat-basic2
/
s
nat
/
ls-03
nat
/
lels
nat
/
succ-01
nat-div
/
two-rec
nat-mult
/
rsucc-02
nat-basic2
/
one
nat-basic2
/
a
nat-basic2
/
c
nat
/
lep
nat
/
cancel-01
nat
/
lep-02
nat-basic1
/
f
nat
/
leprf
nat-basic2
/
add-base
nat
/
lez
nat-div
/
two-loup-12
nat-mult
/
ls-01
nat
/
add-num-03
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
lels-01
nat-basic1
/
lf
nat-basic1
/
trans-1
nat
/
fle-01
nat
/
elim-sub