[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 pot-div3-nls
⊦ 2 ≤ j ∧ 2 < i → ¬ j ^ i / 3 < j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
pot-nls
,
Pot-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le
int-div
/
lsfc-01
int-abs
/
lenls
int-abs
/
forward-lels
int-div
/
div-mult-three-nls
int-abs
/
lels-01
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
ls-pos
int-abs
/
sub-pred
int-basic1
/
forward-pos
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
mone-06
int-abs
/
numls-02
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
zero-02
int-abs
/
numle-02
int-abs
/
elim-sub