[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 bwinv-leqstar
≤BI(cioaut, aioaut) ⊦ C_≤*T_A(cioaut, aioaut)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bw-leqstar
,
imfiniobackwardinv-implies-leqrefine-aux
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 19
Proof steps: 37
Used lemmas:
Used spec theorems:
IOrefine-conds
/
backwardsiminv-def
IOrefine-def
/
leqstar-def
IOtrace
/
fintrace
IOtrace
/
preserve-INV-fin
IOrefine-conds
/
proofobls-backwardsiminv
IOrefine-conds
/
lemma_3-15
IOtrace
/
move
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotstart
IOtrace
/
finexec
remtau
/
finremtau-one
IO-Aut-data
/
sel-IOAut-dotext