[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-three
⊦ 1 < i ∧ i ≠ 2 → (i ≤ 3 ↔ i = 3)
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: 1
Proof steps: 2
Used lemmas:
forward-le-05
,
numlsf-01
,
le-def
,
Used spec theorems:
int-basic1
/
lst-01
Used simplifier rules:
int-basic1
/
lf-01
int-basic1
/
forward-pos
int-basic1
/
ls-01
int-basic1
/
lst-01
int-basic2
/
num-between
int-basic1
/
two-ls
int-basic1
/
lf-02