Step
*
of Lemma
simple-comb-1_wf
∀[Info,A,B:Type]. ∀F:bag(A) ─→ bag(B). ∀[X:EClass(A)]. (F|X| ∈ EClass(B))
BY
{ (ProveWfLemma
THEN (InstLemma `simple-comb_wf` [⌈Info⌉; ⌈B⌉; ⌈1⌉; ⌈λn.A⌉; ⌈λn.[X][n]⌉; ⌈λw.(F (w 0))⌉]⋅ THENA Auto')
THEN Reduce 0
THEN Auto) }
Latex:
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}F:bag(A) {}\mrightarrow{} bag(B). \mforall{}[X:EClass(A)]. (F|X| \mmember{} EClass(B))
By
Latex:
(ProveWfLemma
THEN (InstLemma `simple-comb\_wf` [\mkleeneopen{}Info\mkleeneclose{}; \mkleeneopen{}B\mkleeneclose{}; \mkleeneopen{}1\mkleeneclose{}; \mkleeneopen{}\mlambda{}n.A\mkleeneclose{}; \mkleeneopen{}\mlambda{}n.[X][n]\mkleeneclose{}; \mkleeneopen{}\mlambda{}w.(F (w 0))\mkleeneclose{}]\mcdot{}
THENA Auto'
)
THEN Reduce 0
THEN Auto)
Home
Index