Step
*
2
3
1
3
of Lemma
simple-comb2-classrel
1. Info : Type
2. A : Type
3. B : Type
4. C : Type
5. f : A ─→ B ─→ C
6. X : EClass(A)
7. Y : EClass(B)
8. es : EO+(Info)
9. e : E
10. v : C
11. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:C].
uiff(v ∈ simple-comb(λw.lifting2(f;w 0;w 1);λn.[X; Y][n])(e);↓∃vs:k:ℕ2 ─→ [A; B][k]
((∀k:ℕ2. vs[k] ∈ λn.[X; Y][n][k](e))
∧ (v = (f (vs 0) (vs 1)) ∈ C)))
12. ↓∃vs:k:ℕ2 ─→ [A; B][k]. ((∀k:ℕ2. vs[k] ∈ λn.[X; Y][n][k](e)) ∧ (v = (f (vs 0) (vs 1)) ∈ C))
supposing v ∈ simple-comb(λw.lifting2(f;w 0;w 1);λn.[X; Y][n])(e)
13. a : A
14. b : B
15. (a ∈ X(e) ∧ b ∈ Y(e)) ∧ (v = (f a b) ∈ C)
16. vs : k:ℕ2 ─→ [A; B][k]
⊢ (∀k:ℕ2. vs k ∈ [X; Y][k](e)) ∧ (v = (f (vs 0) (vs 1)) ∈ C) ∈ ℙ
BY
{ MemCD }
1
.....subterm..... T:t
1:n
1. Info : Type
2. A : Type
3. B : Type
4. C : Type
5. f : A ─→ B ─→ C
6. X : EClass(A)
7. Y : EClass(B)
8. es : EO+(Info)
9. e : E
10. v : C
11. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:C].
uiff(v ∈ simple-comb(λw.lifting2(f;w 0;w 1);λn.[X; Y][n])(e);↓∃vs:k:ℕ2 ─→ [A; B][k]
((∀k:ℕ2. vs[k] ∈ λn.[X; Y][n][k](e))
∧ (v = (f (vs 0) (vs 1)) ∈ C)))
12. ↓∃vs:k:ℕ2 ─→ [A; B][k]. ((∀k:ℕ2. vs[k] ∈ λn.[X; Y][n][k](e)) ∧ (v = (f (vs 0) (vs 1)) ∈ C))
supposing v ∈ simple-comb(λw.lifting2(f;w 0;w 1);λn.[X; Y][n])(e)
13. a : A
14. b : B
15. (a ∈ X(e) ∧ b ∈ Y(e)) ∧ (v = (f a b) ∈ C)
16. vs : k:ℕ2 ─→ [A; B][k]
⊢ ∀k:ℕ2. vs k ∈ [X; Y][k](e) ∈ ℙ
2
.....subterm..... T:t
2:n
1. Info : Type
2. A : Type
3. B : Type
4. C : Type
5. f : A ─→ B ─→ C
6. X : EClass(A)
7. Y : EClass(B)
8. es : EO+(Info)
9. e : E
10. v : C
11. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:C].
uiff(v ∈ simple-comb(λw.lifting2(f;w 0;w 1);λn.[X; Y][n])(e);↓∃vs:k:ℕ2 ─→ [A; B][k]
((∀k:ℕ2. vs[k] ∈ λn.[X; Y][n][k](e))
∧ (v = (f (vs 0) (vs 1)) ∈ C)))
12. ↓∃vs:k:ℕ2 ─→ [A; B][k]. ((∀k:ℕ2. vs[k] ∈ λn.[X; Y][n][k](e)) ∧ (v = (f (vs 0) (vs 1)) ∈ C))
supposing v ∈ simple-comb(λw.lifting2(f;w 0;w 1);λn.[X; Y][n])(e)
13. a : A
14. b : B
15. (a ∈ X(e) ∧ b ∈ Y(e)) ∧ (v = (f a b) ∈ C)
16. vs : k:ℕ2 ─→ [A; B][k]
⊢ v = (f (vs 0) (vs 1)) ∈ C ∈ ℙ
Latex:
Latex:
1. Info : Type
2. A : Type
3. B : Type
4. C : Type
5. f : A {}\mrightarrow{} B {}\mrightarrow{} C
6. X : EClass(A)
7. Y : EClass(B)
8. es : EO+(Info)
9. e : E
10. v : C
11. \mforall{}[es:EO+(Info)]. \mforall{}[e:E]. \mforall{}[v:C].
uiff(v \mmember{} simple-comb(\mlambda{}w.lifting2(f;w 0;w 1);\mlambda{}n.[X; Y][n])(e);\mdownarrow{}\mexists{}vs:k:\mBbbN{}2 {}\mrightarrow{} [A; B][k]
((\mforall{}k:\mBbbN{}2
vs[k] \mmember{} \mlambda{}n.[X; Y][n][k](e))
\mwedge{} (v = (f (vs 0) (vs 1)))))
12. \mdownarrow{}\mexists{}vs:k:\mBbbN{}2 {}\mrightarrow{} [A; B][k]. ((\mforall{}k:\mBbbN{}2. vs[k] \mmember{} \mlambda{}n.[X; Y][n][k](e)) \mwedge{} (v = (f (vs 0) (vs 1))))
supposing v \mmember{} simple-comb(\mlambda{}w.lifting2(f;w 0;w 1);\mlambda{}n.[X; Y][n])(e)
13. a : A
14. b : B
15. (a \mmember{} X(e) \mwedge{} b \mmember{} Y(e)) \mwedge{} (v = (f a b))
16. vs : k:\mBbbN{}2 {}\mrightarrow{} [A; B][k]
\mvdash{} (\mforall{}k:\mBbbN{}2. vs k \mmember{} [X; Y][k](e)) \mwedge{} (v = (f (vs 0) (vs 1))) \mmember{} \mBbbP{}
By
Latex:
MemCD
Home
Index