[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 4 from proof neg-intro (
previous step
)
⊦ j = 0, rational(~ ~ i, ~ j) = rational(~ i, j)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ j ≠ 0 → rational(~ i, ~ j) = rational(i, j)
Rule argument
name: neg-neg rotate: F subst: [j, i] → [j, ~ i]
Additional information
Used terms: j, ~ i