[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 partitions-mod-count
⊦ partitions(P, n0) ∧ n < # P ∧ P[n] = pe(m, m0, m1) → (¬ partitions(P[n, pe(m, m0, m2)], n0) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
REFINEONE-theorem
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 33
Proof steps: 75
Used lemmas:
inpartelem-def
,
partititions-def
,
Used spec theorems:
list-del
/partition/
put-rec-02
list-del
/partition/
get-numrec
list-del
/partition/
put-at
Used simplifier rules:
list
/partition/
e-01
list
/partition/
c
list-del
/partition/
put-zero
partelem
/
elim
nat
/
let
nat
/
lels-01
nat-basic1
/
lf-01
nat
/
fle-01
nat
/
le-ls-simp
nat
/
fle
nat-basic1
/
lf
nat-basic1
/
trans-1
nat
/
pred-03
nat
/
elim-pred-c
list-data
/partition/
l
nat-basic1
/
f
nat-basic2
/
s
list
/partition/
len-02
list-del
/partition/
put-length
list
/partition/
len
nat
/
lez
list-del
/partition/
get-zero-01
partelem
/
sel-03
partelem
/
sel-04
nat
/
succ-01
list
/partition/
a
list-del
/partition/
get-succ
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
partelem
/
inj
list-del
/partition/
put-at-eq
nat-basic1
/
lf-02
nat
/
ls-le-simp
nat
/
lels