[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 bint-trans-pos
⊦ j ∈bint ∧ 0 < i ∧ i ≤ j → (¬ i ∈bint ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bint-mult2
,
bint-trans-pos-04
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
inbint
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
lst
int-abs
/
lels-01
int-abs
/
forward-le-05
int-abs
/
forward-le
int-abs
/
forward-lele