[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 5 from proof l (
previous step
)
∀ m, n1, n2. ¬ m0 < m → (m + n1 < m + n2 ↔ n1 < n2), (m < m0 → (m + n1 < m + n2 ↔ n1 < n2)) → (∀ n1, n2. m0 + n1 < m0 + n2 ↔ n1 < n2) ⊦ m0 + n < m0 + n0 ↔ n < n0
User applied rule weakening
And obtained the following new goals
Proof step 6
:
∀ m, n1, n2. ¬ m0 < m → (m + n1 < m + n2 ↔ n1 < n2) ⊦ m0 + n < m0 + n0 ↔ n < n0
Rule argument
poslist: left 2
Additional information