[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 3 from proof factor-rat (
previous step
)
⊦ j ≠ 0 ∧ i1 ≠ 0 → rational(i1 * i, j * i1) = rational(i, j)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 4
:
⊦ i * j = j * i
Proof step 5
:
⊦ j ≠ 0 ∧ i1 ≠ 0 → rational(i1 * i, i1 * j) = rational(i, j)
Rule argument
seq: ⊦ i * j = j * i subst: [j, i] → [i1, j] rotate: F spec: int-mult inst: name: commutativity
Additional information
Used terms: i1, j