[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 updF-get
⊦ m0 ∈ F → F[m, n, i][m0] = (m ≤ m0 ∧ m0 ≤ n ⊃ i;F[m0])
Type: An axiom
Validity: The proof is valid.
Features: localsimp, simp,
Comment: F[m,n,i] overwrites F between m and n with i
Used by:
NEWPARTS-theorem
,
Used by units in proved state:
partition-refinement-test
,
Proof exists?: No