PrintForm
Definitions
exponent
Sections
AutomataTheory
Doc
At:
geom
speed
lbound
1
1
1.
q:
2.
n:
3.
i:
4.
(q
n+1
)
(q
n+1+i-1
)
(q
n
)+(q
n)
(q
n+i
)
By:
Assert (n+1+i-1 = n+i)
THEN
RWH (HypC 5) 4
Generated subgoal:
1
4.
(q
n+1
)
(q
n+i
)
5.
n+1+i-1 = n+i
(q
n
)+(q
n)
(q
n+i
)
About:
(q
n+1
)
(qn+i)
(qn)+(qn)(qn+i)
(qn+1)(qn+1+i-1) (qn)+(qn)(qn+i)(qn+1)(qn+i) (qn)+(qn)(qn+i)
