[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 1 from proof equal-minus-one (conclusion)
⊦ i ≠ 0 ∨ 0 ≤ j → (i ^ j = ~1 ↔ i = ~1 ∧ j ≠ 0 ∧ abs(j) % 2 = 1)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
i ≠ 0 ∨ 0 ≤ j ⊦ i ^ j = ~1 ↔ i = ~1 ∧ j ≠ 0 ∧ abs(j) % 2 = 1
Rule argument
Additional information