[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 imfin-lemma-aux
⊦ ∃ ass0. ∀ as0. as0 ∈ ass0 ↔ (∃ as. as ∈ ass ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
imfin-lemma
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 39
Proof steps: 105
Used lemmas:
Used spec theorems:
Used simplifier rules:
set-basic
/DQ-refines-DurQ-instance-astateset-stateset/
In-empty
set-basic
/DQ-refines-DurQ-instance-astateset-stateset/
In-insert
DurQ
/DurQ-ren/
elim-mkstate
DurQ
/DurQ-ren/
upd-mkstate-dotlsf
DurQ
/DurQ-ren/
upd-mkstate-dotpcf
DurQ
/DurQ-ren/
sel-mkstate-dotlsf
DurQ
/DurQ-ren/
sel-mkstate-dotpcf
DQ
/
elim-mkls
DurQ
/DurQ-ren/
inj-mkstate
set-basic
/DQ-refines-DurQ-instance-astateset-stateset/
size-zero-01
set-basic
/DQ-refines-DurQ-instance-astateset-stateset/
ne-01