[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 sources-in-two
⊦ d0 ∈ sources(co ' + co0 ', d) ↔ d0 = d ∨ d0 = cdom(co0) ∧ d0 ⇒ d ∨ d0 = cdom(co) ∧ d0 ⇒ d ∨ d0 = cdom(co) ∧ d0 ⇒ cdom(co0) ∧ cdom(co0) ⇒ d
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
sources-not-transitive
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 40
Used lemmas:
sources-1
,
sources-not-empty-01
,
sources-base
,
sources-one
,
sources-not-empty
,
sources-rec
,
Used spec theorems:
Used simplifier rules:
set-basic
/gen-secdomain-set/
In-insert
set-basic
/gen-secdomain-set/
in-02
set-basic
/gen-secdomain-set/
size-one-01
set-basic
/gen-secdomain-set/
in-04
set-basic
/gen-secdomain-set/
rax
set-basic
/gen-secdomain-set/
size-zero
set-basic
/gen-secdomain-set/
ne
set-basic
/gen-secdomain-set/
size-zero-01
set-basic
/gen-secdomain-set/
ne-01