[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 le-one
⊦ 1 < j → (i * j ≤ 1 ↔ i ≤ 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
square-ex
,
two-leone
,
Used by units in proved state:
int-pot
,
int-gcd
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
zero-gr
,
commutativity
,
associativity
,
ls-same
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
forward-lels
int-abs
/
forward-le-04
int-abs
/
lenls
int-abs
/
lsone
int-abs
/
lels-03