[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 mods-eq (conclusion)
⊦ 0 ≤ i ∧ 0 ≤ i0 ∧ 0 ≤ j0 ∧ 0 ≤ j1 ∧ j0 < j ∧ j1 < j → (i * j + j0 = i0 * j + j1 ↔ i = i0 ∧ j0 = j1)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
j0 < j, j1 < j, 0 ≤ i, 0 ≤ i0, 0 ≤ j0, 0 ≤ j1 ⊦ i * j + j0 = i0 * j + j1 ↔ i = i0 ∧ j0 = j1
Rule argument
Additional information