[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 branchingfw-normedfw
≤bF(cioaut, aioaut) ⊦ ≤nF(cioaut, aioaut)
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: 5
Proof steps: 10
Used lemmas:
branchingfw-normedfw-aux
,
Used spec theorems:
branchingIOforward
/
branchingforwardsim-def
normedIOforward
/
normedforwardsim-def
Used simplifier rules: