Step
*
2
2
2
1
1
of Lemma
prec-ext
.....wf.....
1. P : Type
2. a : Atom ⟶ P ⟶ ((P + P + Type) List)
3. pcorec(lbl,p.a[lbl;p]) ≡ ptuple(lbl,p.a[lbl;p];pcorec(lbl,p.a[lbl;p]))
4. i : P
5. pcorec(lbl,p.a[lbl;p]) i ≡ labl:{lbl:Atom| 0 < ||a[lbl;i]||} × tuple-type(map(λx.case x
of inl(y) =>
case y
of inl(p) =>
pcorec(lbl,p.a[lbl;p]) p
| inr(p) =>
(pcorec(lbl,p.a[lbl;p]) p) List
| inr(E) =>
E;a[labl;i]))
6. labl : {lbl:Atom| 0 < ||a[lbl;i]||}
7. u : P + P + Type
8. v : (P + P + Type) List
9. null(v) = ff
10. x2 : case u
of inl(y) =>
case y of inl(p) => prec(lbl,p.a[lbl;p];p) | inr(p) => prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E
11. x3 : tuple-type(map(λx.case x
of inl(y) =>
case y of inl(p) => prec(lbl,p.a[lbl;p];p) | inr(p) => prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E;v))
12. (1 + add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3))↓
⊢ add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3) ∈ ℕ
BY
{ (MoveToConcl (-1) THEN GenConclTerm ⌜add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3)⌝⋅) }
1
.....wf.....
1. P : Type
2. a : Atom ⟶ P ⟶ ((P + P + Type) List)
3. pcorec(lbl,p.a[lbl;p]) ≡ ptuple(lbl,p.a[lbl;p];pcorec(lbl,p.a[lbl;p]))
4. i : P
5. pcorec(lbl,p.a[lbl;p]) i ≡ labl:{lbl:Atom| 0 < ||a[lbl;i]||} × tuple-type(map(λx.case x
of inl(y) =>
case y
of inl(p) =>
pcorec(lbl,p.a[lbl;p]) p
| inr(p) =>
(pcorec(lbl,p.a[lbl;p]) p) List
| inr(E) =>
E;a[labl;i]))
6. labl : {lbl:Atom| 0 < ||a[lbl;i]||}
7. u : P + P + Type
8. v : (P + P + Type) List
9. null(v) = ff
10. x2 : case u
of inl(y) =>
case y of inl(p) => prec(lbl,p.a[lbl;p];p) | inr(p) => prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E
11. x3 : tuple-type(map(λx.case x
of inl(y) =>
case y of inl(p) => prec(lbl,p.a[lbl;p];p) | inr(p) => prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E;v))
⊢ add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3) ∈ partial(ℕ)
2
1. P : Type
2. a : Atom ⟶ P ⟶ ((P + P + Type) List)
3. pcorec(lbl,p.a[lbl;p]) ≡ ptuple(lbl,p.a[lbl;p];pcorec(lbl,p.a[lbl;p]))
4. i : P
5. pcorec(lbl,p.a[lbl;p]) i ≡ labl:{lbl:Atom| 0 < ||a[lbl;i]||} × tuple-type(map(λx.case x
of inl(y) =>
case y
of inl(p) =>
pcorec(lbl,p.a[lbl;p]) p
| inr(p) =>
(pcorec(lbl,p.a[lbl;p]) p) List
| inr(E) =>
E;a[labl;i]))
6. labl : {lbl:Atom| 0 < ||a[lbl;i]||}
7. u : P + P + Type
8. v : (P + P + Type) List
9. null(v) = ff
10. x2 : case u
of inl(y) =>
case y of inl(p) => prec(lbl,p.a[lbl;p];p) | inr(p) => prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E
11. x3 : tuple-type(map(λx.case x
of inl(y) =>
case y of inl(p) => prec(lbl,p.a[lbl;p];p) | inr(p) => prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E;v))
12. v1 : partial(ℕ)
13. add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3) = v1 ∈ partial(ℕ)
⊢ (1 + v1)↓ ⇒ (v1 ∈ ℕ)
Latex:
Latex:
.....wf.....
1. P : Type
2. a : Atom {}\mrightarrow{} P {}\mrightarrow{} ((P + P + Type) List)
3. pcorec(lbl,p.a[lbl;p]) \mequiv{} ptuple(lbl,p.a[lbl;p];pcorec(lbl,p.a[lbl;p]))
4. i : P
5. pcorec(lbl,p.a[lbl;p]) i \mequiv{} labl:\{lbl:Atom| 0 < ||a[lbl;i]||\} \mtimes{} tuple-type(map(\mlambda{}x.case x
of inl(y) =>
case y
of inl(p) =>
pcorec(lbl,p.a[lbl;p]) p
| inr(p) =>
(pcorec(lbl,p.a[lbl;p]) p) List
| inr(E) =>
E;a[labl;i]))
6. labl : \{lbl:Atom| 0 < ||a[lbl;i]||\}
7. u : P + P + Type
8. v : (P + P + Type) List
9. null(v) = ff
10. x2 : case u
of inl(y) =>
case y of inl(p) => prec(lbl,p.a[lbl;p];p) | inr(p) => prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E
11. x3 : tuple-type(map(\mlambda{}x.case x
of inl(y) =>
case y
of inl(p) =>
prec(lbl,p.a[lbl;p];p)
| inr(p) =>
prec(lbl,p.a[lbl;p];p) List
| inr(E) =>
E;v))
12. (1 + add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3))\mdownarrow{}
\mvdash{} add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3) \mmember{} \mBbbN{}
By
Latex:
(MoveToConcl (-1) THEN GenConclTerm \mkleeneopen{}add-sz(pcorec-size(lbl,p.a[lbl;p]);v;x3)\mkleeneclose{}\mcdot{})
Home
Index