[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-def
⊦ (n * (n + 1)) / 2 ≤ m ∧ m < ((n + 1) * (n + 2)) / 2 ∧ (m0 * (m0 + 1)) / 2 ≤ m → maxenc(m0, m) = n
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max-def-01
,
max-rev
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 16
Used lemmas:
maxi-found
,
maxi-rec
,
Used spec theorems:
nat-div
/
square-interval
nat-basic
/
add-base
nat
/
le-def
nat-div
/
square-ls-02
Used simplifier rules:
nat-mult
/
rsucc-02
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-div
/
two-rec
nat-basic
/
s-04
nat-basic
/
a
nat-basic
/
c
nat
/
lez
nat-basic
/
z-02
nat
/
succ-01
nat
/
lels
nat-div
/
ls-02
nat
/
let
nat-div
/
two-zero-01-01
nat-mult
/
square-one
nat
/
fle-01
nat-basic
/
trans-nat
nat-basic
/
f
nat
/
fle
nat-basic
/
refl-nat
nat-basic
/
ls-02
nat-div
/
two-loup-12
nat-mult
/
ls-01
nat-basic
/
z-01
nat
/
ls-01
nat
/
sub-ls