Step
*
1
of Lemma
hered-term-accum_wf
1. opr : Type
2. P : term(opr) ⟶ ℙ
3. Param : Type
4. C : Param ⟶ (varname() List × hered-term(opr;t.P[t])) ⟶ Type
5. nextp : Param ⟶ (varname() List) ⟶ opr ⟶ very-dep-fun(Param;varname() List × hered-term(opr;t.P[t]);a,bt.C[a;bt])
6. m : a:Param
⟶ vs:(varname() List)
⟶ f:opr
⟶ L:{L:(a:Param × bt:varname() List × hered-term(opr;t.P[t]) × C[a;bt]) List|
vdf-eq(Param;nextp a vs f;L) ∧ hereditarily(opr;s.P[s];mkterm(f;map(λx.(fst(snd(x)));L)))}
⟶ C[a;<vs, mkterm(f;map(λx.(fst(snd(x)));L))>]
7. varcase : a:Param
⟶ vs:(varname() List)
⟶ v:{v:varname()| (¬(v = nullvar() ∈ varname())) ∧ P[varterm(v)]}
⟶ C[a;<vs, varterm(v)>]
8. n : ℕ
9. ∀n:ℕn. ∀p:Param. ∀bt:varname() List × hered-term(opr;t.P[t]).
((term-size(snd(bt)) ≤ n)
⇒ (hered-term-accum(p,vs,v.varcase[p;vs;v];
prm,vs,f,L.m[prm;vs;f;L];
p0,ws,op,sofar,bt.nextp[p0;ws;op;sofar;bt];
p;
bt) ∈ C[p;bt]))
10. p : Param
11. b1 : varname() List
12. y1 : opr
13. y2 : (varname() List × term(opr)) List
14. hereditarily(opr;s.P[s];inr <y1, y2> )
15. term-size(inr <y1, y2> ) ≤ n
⊢ let L = bound-terms-accum(sofar,bt.nextp[p;b1;y1;sofar;bt];p',bt.hered-term-accum(p,vs,v.varcase[p;vs;v];
prm,vs,f,L.m[prm;vs;f;L];
p0,ws,op,sofar,bt.nextp[p0;ws;op;
sofar;bt];
p';
bt);y2) in
m[p;b1;y1;L] ∈ C[p;<b1, inr <y1, y2> >]
BY
{ ((Assert λsofar,bt. nextp[p;b1;y1;sofar;bt] ∈ very-dep-fun(Param;varname() List × hered-term(opr;t.P[t]);a,bt.C[a;bt])\000C BY
(Unfold `so_apply` 0
THEN (GenConclTerm ⌜nextp p b1 y1⌝⋅ THENA Auto)
THEN (Enough to prove v
= (λsofar,bt. (v sofar bt))
∈ very-dep-fun(Param;varname() List × hered-term(opr;t.P[t]);a,bt.C[a;bt])
Because (All (Unfold `so_apply`) THEN Eq))
THEN BLemma `very-dep-fun-eta`
THEN Auto))
THEN (Assert y2 ∈ (varname() List × hered-term(opr;t.P[t])) List BY
(RepeatFor 2 (Thin (-1))
THEN (Fold `mkterm` (-1) THEN (RWO "hereditarily-mkterm" (-1) THENA Auto))
THEN D -1
THEN UseListSubtype
THEN Auto
THEN InstHyp [⌜<x1, x2>⌝] (-5)⋅
THEN Auto))
THEN (InstLemma `bound-terms-accum_wf` [⌜opr⌝;⌜P⌝;⌜Param⌝;⌜C⌝;⌜y2⌝;⌜λ2sofar bt.nextp[p;b1;y1;sofar;bt]⌝]⋅
THENA Auto
)) }
1
1. opr : Type
2. P : term(opr) ⟶ ℙ
3. Param : Type
4. C : Param ⟶ (varname() List × hered-term(opr;t.P[t])) ⟶ Type
5. nextp : Param ⟶ (varname() List) ⟶ opr ⟶ very-dep-fun(Param;varname() List × hered-term(opr;t.P[t]);a,bt.C[a;bt])
6. m : a:Param
⟶ vs:(varname() List)
⟶ f:opr
⟶ L:{L:(a:Param × bt:varname() List × hered-term(opr;t.P[t]) × C[a;bt]) List|
vdf-eq(Param;nextp a vs f;L) ∧ hereditarily(opr;s.P[s];mkterm(f;map(λx.(fst(snd(x)));L)))}
⟶ C[a;<vs, mkterm(f;map(λx.(fst(snd(x)));L))>]
7. varcase : a:Param
⟶ vs:(varname() List)
⟶ v:{v:varname()| (¬(v = nullvar() ∈ varname())) ∧ P[varterm(v)]}
⟶ C[a;<vs, varterm(v)>]
8. n : ℕ
9. ∀n:ℕn. ∀p:Param. ∀bt:varname() List × hered-term(opr;t.P[t]).
((term-size(snd(bt)) ≤ n)
⇒ (hered-term-accum(p,vs,v.varcase[p;vs;v];
prm,vs,f,L.m[prm;vs;f;L];
p0,ws,op,sofar,bt.nextp[p0;ws;op;sofar;bt];
p;
bt) ∈ C[p;bt]))
10. p : Param
11. b1 : varname() List
12. y1 : opr
13. y2 : (varname() List × term(opr)) List
14. hereditarily(opr;s.P[s];inr <y1, y2> )
15. term-size(inr <y1, y2> ) ≤ n
16. λsofar,bt. nextp[p;b1;y1;sofar;bt] ∈ very-dep-fun(Param;varname() List × hered-term(opr;t.P[t]);a,bt.C[a;bt])
17. y2 ∈ (varname() List × hered-term(opr;t.P[t])) List
18. ∀[g:a:Param ⟶ bt:{bt:varname() List × hered-term(opr;t.P[t])| (bt ∈ y2)} ⟶ C[a;bt]]
(bound-terms-accum(L,bt.nextp[p;b1;y1;L;bt];a,bt.g[a;bt];y2) ∈ {L:(a:Param
× b:varname() List × hered-term(opr;t.P[t])
× C[a;b]) List|
vdf-eq(Param;λ2sofar bt.nextp[p;b1;y1;sofar;bt];L)
∧ (map(λx.(fst(snd(x)));L)
= y2
∈ ((varname() List
× hered-term(opr;t.P[t])) List))} )
⊢ let L = bound-terms-accum(sofar,bt.nextp[p;b1;y1;sofar;bt];p',bt.hered-term-accum(p,vs,v.varcase[p;vs;v];
prm,vs,f,L.m[prm;vs;f;L];
p0,ws,op,sofar,bt.nextp[p0;ws;op;
sofar;bt];
p';
bt);y2) in
m[p;b1;y1;L] ∈ C[p;<b1, inr <y1, y2> >]
Latex:
Latex:
1. opr : Type
2. P : term(opr) {}\mrightarrow{} \mBbbP{}
3. Param : Type
4. C : Param {}\mrightarrow{} (varname() List \mtimes{} hered-term(opr;t.P[t])) {}\mrightarrow{} Type
5. nextp : Param
{}\mrightarrow{} (varname() List)
{}\mrightarrow{} opr
{}\mrightarrow{} very-dep-fun(Param;varname() List \mtimes{} hered-term(opr;t.P[t]);a,bt.C[a;bt])
6. m : a:Param
{}\mrightarrow{} vs:(varname() List)
{}\mrightarrow{} f:opr
{}\mrightarrow{} L:\{L:(a:Param \mtimes{} bt:varname() List \mtimes{} hered-term(opr;t.P[t]) \mtimes{} C[a;bt]) List|
vdf-eq(Param;nextp a vs f;L) \mwedge{} hereditarily(opr;s.P[s];mkterm(f;map(\mlambda{}x.(fst(snd(x)));L)))\}
{}\mrightarrow{} C[a;<vs, mkterm(f;map(\mlambda{}x.(fst(snd(x)));L))>]
7. varcase : a:Param
{}\mrightarrow{} vs:(varname() List)
{}\mrightarrow{} v:\{v:varname()| (\mneg{}(v = nullvar())) \mwedge{} P[varterm(v)]\}
{}\mrightarrow{} C[a;<vs, varterm(v)>]
8. n : \mBbbN{}
9. \mforall{}n:\mBbbN{}n. \mforall{}p:Param. \mforall{}bt:varname() List \mtimes{} hered-term(opr;t.P[t]).
((term-size(snd(bt)) \mleq{} n)
{}\mRightarrow{} (hered-term-accum(p,vs,v.varcase[p;vs;v];
prm,vs,f,L.m[prm;vs;f;L];
p0,ws,op,sofar,bt.nextp[p0;ws;op;sofar;bt];
p;
bt) \mmember{} C[p;bt]))
10. p : Param
11. b1 : varname() List
12. y1 : opr
13. y2 : (varname() List \mtimes{} term(opr)) List
14. hereditarily(opr;s.P[s];inr <y1, y2> )
15. term-size(inr <y1, y2> ) \mleq{} n
\mvdash{} let L = bound-terms-accum(sofar,bt.nextp[p;b1;y1;sofar;
bt];p',bt.hered-term-accum(p,vs,v.varcase[p;vs;v];
prm,vs,f,L.m[prm;vs;f;L];
p0,ws,op,sofar,bt.nextp[p0;ws;
op;
sofar;
bt];
p';
bt);y2) in
m[p;b1;y1;L] \mmember{} C[p;<b1, inr <y1, y2> >]
By
Latex:
((Assert \mlambda{}sofar,bt. nextp[p;b1;y1;sofar;bt] \mmember{} very-dep-fun(Param;varname() List
\mtimes{} hered-term(opr;t.P[t]);a,bt.C[a;bt]) BY
(Unfold `so\_apply` 0
THEN (GenConclTerm \mkleeneopen{}nextp p b1 y1\mkleeneclose{}\mcdot{} THENA Auto)
THEN (Enough to prove v = (\mlambda{}sofar,bt. (v sofar bt))
Because (All (Unfold `so\_apply`) THEN Eq))
THEN BLemma `very-dep-fun-eta`
THEN Auto))
THEN (Assert y2 \mmember{} (varname() List \mtimes{} hered-term(opr;t.P[t])) List BY
(RepeatFor 2 (Thin (-1))
THEN (Fold `mkterm` (-1) THEN (RWO "hereditarily-mkterm" (-1) THENA Auto))
THEN D -1
THEN UseListSubtype
THEN Auto
THEN InstHyp [\mkleeneopen{}<x1, x2>\mkleeneclose{}] (-5)\mcdot{}
THEN Auto))
THEN (InstLemma `bound-terms-accum\_wf` [\mkleeneopen{}opr\mkleeneclose{};\mkleeneopen{}P\mkleeneclose{};\mkleeneopen{}Param\mkleeneclose{};\mkleeneopen{}C\mkleeneclose{};\mkleeneopen{}y2\mkleeneclose{};
\mkleeneopen{}\mlambda{}\msubtwo{}sofar bt.nextp[p;b1;y1;sofar;bt]\mkleeneclose{}]\mcdot{}
THENA Auto
))
Home
Index