Nuprl - Proof: iter via intseg comp binop 1 2 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: iter via intseg comp binop 1 2 1 1

1. A : Type
2. f : A

A
3. u : A
4. is_commutative_sep(A; f)
5. is_ident(A; f; u)
6. is_assoc_sep(A; f)
7. a :

b:{...a}, e,g:({a..b

}

A).
8. f((Iter(f;u) i:{a..b

}. e(i)),Iter(f;u) i:{a..b

}. g(i))
8. =
8. (Iter(f;u) i:{a..b

}. f(e(i),g(i)))
9. b : {a...}
10.

c:{a..b

}, e,g:({a..c

}

A).
10. f((Iter(f;u) i:{a..c

}. e(i)),Iter(f;u) i:{a..c

}. g(i))
10. =
10. (Iter(f;u) i:{a..c

}. f(e(i),g(i)))
11. e : {a..b

}

A
12. g : {a..b

}

A
13. a = b

f((Iter(f;u) i:{a..b

}. e(i)),Iter(f;u) i:{a..b

}. g(i))

(Iter(f;u) i:{a..b

}. f(e(i),g(i)))

By:	BackThru: Hyp:8

Generated subgoals:

None

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html