[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 samepartitions-def
⊦ samepartitions(P, A, P0, A0) ↔ # P = # P0 ∧ (∀ n. n < # P → ⟦P[n]⟧ (A) = ⟦P0[n]⟧ (A0))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
NEWPARTS-theorem
,
REFINEONE-theorem
,
samepartitions-same
,
Used by units in proved state:
Proof exists?: No