[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 alignup-add-le (conclusion)
m ≠ 0 ⊦ align↑(n0, m) + n1 ≤ n0 ↔ n1 = 0 ∧ is-aligned(n0, m)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
⊦ align↑(n0, m) + n1 ≤ n0 ↔ n1 = 0 ∧ is-aligned(n0, m), m = 0
Rule argument
Additional information