PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc

At: member mapoutl

A,B:Type, s:(A+B) List, x:A. (x mapoutl(s)) (y:A+B. (y s) & isl(y) & x = outl(y))

By:
(UnivCD THEN (Unfold `mapoutl` 0) THEN (RWO Thm* P:(T), T':Type, f:({x:T| P(x) }T'), L:T List, x:T'. (x mapfilter(f;P;L)) (y:T. (y L) & P(y) & x = f(y)) 0)) THENA (Auto THEN (All Reduce) THEN (Try ((Analyze -1) THEN Unhide)))
THEN
Reduce 0


Generated subgoals:

None

About:
listboolassertunionsetapplyfunction
universeequalandallexists

PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc