[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
,
Proof step 9 from proof two-le-two (
previous step
)
2 < i * i, 0 < i * i, 1 < i * i, abs(i) ≤ 1 ⊦
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 10
:
⊦ i ≠ 0 ∧ i ≠ 1 → (abs(i) ≤ 1 ↔ i = ~1)
Rule argument
spec: int-abs name: abs-one-01 seq: ⊦ i ≠ 0 ∧ i ≠ 1 → (abs(i) ≤ 1 ↔ i = ~1) subst: [i] → [i] flags: <all paths>
Additional information
Used terms: i