[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 putrow-outside-id
⊦ #r mx ≤ r ∧ # a = #c mx → mx[r := a]r = mx
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
updrow-sel
,
colno-updrow
,
rowno-updrow
,
Used spec theorems:
matrix
/
extension
Used simplifier rules:
nat-basic
/
f
nat
/
fle
nat-basic
/
lf-01
nat
/
ls-le-simp