(7steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc
At:
assert
l
ball
T:Type, L:T List, P:(T
). (
x
L.P(x))
(
i:
||L||. P(L[i]))
By:
InductionOnList
THEN
Reduce 0
THEN
Try (RW assert_pushdownC 0)
Generated subgoals:
1
1.
T:
Type
2.
L:
T List
3.
u:
T
4.
v:
T List
5.
P:(T
). (
x
v.P(x))
(
i:
||v||. P(v[i]))
6.
P:
T
7.
P(u)
8.
(
x
v.P(x))
9.
i:
(||v||+1)
P([u / v][i])
2
steps
 
2
1.
T:
Type
2.
L:
T List
3.
u:
T
4.
v:
T List
5.
P:(T
). (
x
v.P(x))
(
i:
||v||. P(v[i]))
6.
P:
T
7.
i:
(||v||+1). P([u / v][i])
P(u)
1
step
 
3
1.
T:
Type
2.
L:
T List
3.
u:
T
4.
v:
T List
5.
P:(T
). (
x
v.P(x))
(
i:
||v||. P(v[i]))
6.
P:
T
7.
i:
(||v||+1). P([u / v][i])
(
x
v.P(x))
3
steps
About:
(7steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc