[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 counttheshit
∀ p. p ∈ ps → fpathtolink(p) ∈ ls, ∀ alink. alink ∈ ls → (∃ p. p ∈ ps ∧ fpathtolink(p) = alink), ∀ p, q. p ∈ ps ∧ q ∈ ps ∧ fpathtolink(p) = fpathtolink(q) → p = q ⊦ # ps = # ls ↔ true
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 30
Used lemmas:
Used spec theorems:
set-basic
/alink-set/
Extension
set-basic
/pathset/
Extension
set-basic
/pathset/
indef
set-basic
/alink-set/
indef
Used simplifier rules:
set-basic
/alink-set/
size-zero
set-basic
/pathset/
Size-empty
set-basic
/alink-set/
In-empty
set-basic
/pathset/
size-zero
set-basic
/pathset/
In-empty
set-basic
/pathset/
In-insert
set-basic
/alink-set/
size-zero-01
set-basic
/alink-set/
ne-01
set-basic
/alink-set/
In-insert
nat-basic
/
oz
nat-basic
/
eq-01
afs-asm
/
Insert-size
set-basic
/alink-set/
ne
set-basic
/pathset/
Size-insert
nat-basic
/
s-04
oelem
/nat-set/
irreflexivity
nat-basic
/
a
nat-basic
/
c
set-basic
/pathset/
size-zero-01
set-basic
/pathset/
ne-01