(3steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc

At: map before 1

1. T: Type
2. T': Type
3. f: TT'
4. x: T
5. y: T
6. s: T List
7. f1: 2||s||
8. j:2. [x; y][j] = s[(f1(j))]
j:2. [(f(x)); (f(y))][j] = map(f;s)[(f1(j))]

By: (((ParallelOp -1) THEN (RWO Thm* f:(AB), as:A List, n:||as||. map(f;as)[n] = f(as[n]) 0)) THEN (RevHypSubst -1 0)) THENA (Auto THEN (Reduce 0))

Generated subgoal:

19. j: 2
10. [x; y][j] = s[(f1(j))]
[(f(x)); (f(y))][j] = f([x; y][j])
1 step

About:
listconsnilnatural_numberapplyfunctionuniverseequalall

(3steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc