[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 partititions-def
⊦ partitions(P, n0) ↔ (∀ n. n < n0 → (∃ m. m < # P ∧ n ∈ P[m] ∧ (∀ m0. m0 < # P ∧ m0 ≠ m → ¬ n ∈ P[m0])))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
NEWPARTS-theorem
,
REFINEONE-theorem
,
partitions-mod-count
,
split-init-2
,
Used by units in proved state:
Proof exists?: No