[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 one-03
⊦ 0 < i ∧ 0 ≤ j → (1 = i + j ↔ i = 1 ∧ j = 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
sub-eq
,
lsone
,
sub-ls-01
,
sub-add
,
sub-add-01
,
forward-le-05
,
le-def
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
add-zero-rev
int-basic1
/
lst-02