Step
*
2
2
2
1
2
2
of Lemma
vdf-wf+
.....eq aux.....
1. A : Type
2. B : Type
3. C : A ⟶ B ⟶ Type
4. n : ℤ
5. 0 < n
6. vdf(A;B;a,b.C[a;b];n - 1) ∈ Type
7. ∀f:vdf(A;B;a,b.C[a;b];n - 1). ∀L:(a:A × b:B × C[a;b]) List.
((||L|| ≤ ((n - 1) + 1))
⇒ ((vdf-eq(A;f;L) ∈ ℙ) ∧ (vdf-eq(A;f;L) ⊆r (∀[i:ℕ||L||]. ((fst(L[i])) = (f firstn(i;L) (fst(snd(L[i])))) ∈ A)))))
8. vdf(A;B;a,b.C[a;b];n) ∈ Type
9. f : f:vdf(A;B;a,b.C[a;b];n - 1) ⋂ {L:(a:A × b:B × C[a;b]) List| (||L|| ≤ n) ∧ vdf-eq(A;f;L)} ⟶ B ⟶ A
10. f ∈ vdf(A;B;a,b.C[a;b];n - 1)
11. f ∈ {L:(a:A × b:B × C[a;b]) List| (||L|| ≤ n) ∧ vdf-eq(A;f;L)} ⟶ B ⟶ A
12. L : (a:A × b:B × C[a;b]) List
13. ||L|| ≤ (n + 1)
14. ∀m:ℕ
(m < ||L||
⇒ (dep-all(m;i.let a,b,c = firstn(||L|| - 1;L)[i] in
a = (f firstn(i;firstn(||L|| - 1;L)) b) ∈ A) ~ dep-all(m;i.let a,b,c = L[i] in
a = (f firstn(i;L) b) ∈ A)))
15. ¬(||L|| ≤ n)
16. ¬||L|| < 1
⊢ istype(dep-all(||L|| - 1;i.let a,b,c = L[i] in
a = (f firstn(i;L) b) ∈ A))
BY
{ (RWO "-3<" 0 THENA Auto) }
1
1. A : Type
2. B : Type
3. C : A ⟶ B ⟶ Type
4. n : ℤ
5. 0 < n
6. vdf(A;B;a,b.C[a;b];n - 1) ∈ Type
7. ∀f:vdf(A;B;a,b.C[a;b];n - 1). ∀L:(a:A × b:B × C[a;b]) List.
((||L|| ≤ ((n - 1) + 1))
⇒ ((vdf-eq(A;f;L) ∈ ℙ) ∧ (vdf-eq(A;f;L) ⊆r (∀[i:ℕ||L||]. ((fst(L[i])) = (f firstn(i;L) (fst(snd(L[i])))) ∈ A)))))
8. vdf(A;B;a,b.C[a;b];n) ∈ Type
9. f : f:vdf(A;B;a,b.C[a;b];n - 1) ⋂ {L:(a:A × b:B × C[a;b]) List| (||L|| ≤ n) ∧ vdf-eq(A;f;L)} ⟶ B ⟶ A
10. f ∈ vdf(A;B;a,b.C[a;b];n - 1)
11. f ∈ {L:(a:A × b:B × C[a;b]) List| (||L|| ≤ n) ∧ vdf-eq(A;f;L)} ⟶ B ⟶ A
12. L : (a:A × b:B × C[a;b]) List
13. ||L|| ≤ (n + 1)
14. ∀m:ℕ
(m < ||L||
⇒ (dep-all(m;i.let a,b,c = firstn(||L|| - 1;L)[i] in
a = (f firstn(i;firstn(||L|| - 1;L)) b) ∈ A) ~ dep-all(m;i.let a,b,c = L[i] in
a = (f firstn(i;L) b) ∈ A)))
15. ¬(||L|| ≤ n)
16. ¬||L|| < 1
⊢ ||L|| - 1 < ||L||
2
1. A : Type
2. B : Type
3. C : A ⟶ B ⟶ Type
4. n : ℤ
5. 0 < n
6. vdf(A;B;a,b.C[a;b];n - 1) ∈ Type
7. ∀f:vdf(A;B;a,b.C[a;b];n - 1). ∀L:(a:A × b:B × C[a;b]) List.
((||L|| ≤ ((n - 1) + 1))
⇒ ((vdf-eq(A;f;L) ∈ ℙ) ∧ (vdf-eq(A;f;L) ⊆r (∀[i:ℕ||L||]. ((fst(L[i])) = (f firstn(i;L) (fst(snd(L[i])))) ∈ A)))))
8. vdf(A;B;a,b.C[a;b];n) ∈ Type
9. f : f:vdf(A;B;a,b.C[a;b];n - 1) ⋂ {L:(a:A × b:B × C[a;b]) List| (||L|| ≤ n) ∧ vdf-eq(A;f;L)} ⟶ B ⟶ A
10. f ∈ vdf(A;B;a,b.C[a;b];n - 1)
11. f ∈ {L:(a:A × b:B × C[a;b]) List| (||L|| ≤ n) ∧ vdf-eq(A;f;L)} ⟶ B ⟶ A
12. L : (a:A × b:B × C[a;b]) List
13. ||L|| ≤ (n + 1)
14. ∀m:ℕ
(m < ||L||
⇒ (dep-all(m;i.let a,b,c = firstn(||L|| - 1;L)[i] in
a = (f firstn(i;firstn(||L|| - 1;L)) b) ∈ A) ~ dep-all(m;i.let a,b,c = L[i] in
a = (f firstn(i;L) b) ∈ A)))
15. ¬(||L|| ≤ n)
16. ¬||L|| < 1
⊢ istype(dep-all(||L|| - 1;i.let a,b,c = firstn(||L|| - 1;L)[i] in
a = (f firstn(i;firstn(||L|| - 1;L)) b) ∈ A))
Latex:
Latex:
.....eq aux.....
1. A : Type
2. B : Type
3. C : A {}\mrightarrow{} B {}\mrightarrow{} Type
4. n : \mBbbZ{}
5. 0 < n
6. vdf(A;B;a,b.C[a;b];n - 1) \mmember{} Type
7. \mforall{}f:vdf(A;B;a,b.C[a;b];n - 1). \mforall{}L:(a:A \mtimes{} b:B \mtimes{} C[a;b]) List.
((||L|| \mleq{} ((n - 1) + 1))
{}\mRightarrow{} ((vdf-eq(A;f;L) \mmember{} \mBbbP{})
\mwedge{} (vdf-eq(A;f;L) \msubseteq{}r (\mforall{}[i:\mBbbN{}||L||]. ((fst(L[i])) = (f firstn(i;L) (fst(snd(L[i])))))))))
8. vdf(A;B;a,b.C[a;b];n) \mmember{} Type
9. f : f:vdf(A;B;a,b.C[a;b];n - 1) \mcap{} \{L:(a:A \mtimes{} b:B \mtimes{} C[a;b]) List| (||L|| \mleq{} n) \mwedge{} vdf-eq(A;f;L)\}
{}\mrightarrow{} B
{}\mrightarrow{} A
10. f \mmember{} vdf(A;B;a,b.C[a;b];n - 1)
11. f \mmember{} \{L:(a:A \mtimes{} b:B \mtimes{} C[a;b]) List| (||L|| \mleq{} n) \mwedge{} vdf-eq(A;f;L)\} {}\mrightarrow{} B {}\mrightarrow{} A
12. L : (a:A \mtimes{} b:B \mtimes{} C[a;b]) List
13. ||L|| \mleq{} (n + 1)
14. \mforall{}m:\mBbbN{}
(m < ||L||
{}\mRightarrow{} (dep-all(m;i.let a,b,c = firstn(||L|| - 1;L)[i] in
a = (f firstn(i;firstn(||L|| - 1;L)) b)) \msim{} dep-all(m;i.let a,b,c = L[i] in
a = (f firstn(i;L) b))))
15. \mneg{}(||L|| \mleq{} n)
16. \mneg{}||L|| < 1
\mvdash{} istype(dep-all(||L|| - 1;i.let a,b,c = L[i] in
a = (f firstn(i;L) b)))
By
Latex:
(RWO "-3<" 0 THENA Auto)
Home
Index