[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 Extension
⊦ ar1 = ar2 ↔ # ar1 = # ar2 ∧ (∀ n. n < # ar1 → ar1[n] = ar2[n])
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment: |- ar1 = ar2 <-> # ar1 = # ar2 and (all n. n < # ar1 -> ar1[n] = ar2[n])
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
Used spec theorems:
list-del
/
extension
Used simplifier rules:
list-data
/
l
nat-basic
/
lf-01
nat-basic
/
f