|
315
|
1 open import Level
|
|
|
2 open import Relation.Binary.PropositionalEquality
|
|
|
3
|
|
|
4 module system-f {l : Level} where
|
|
|
5
|
|
|
6 postulate A : Set
|
|
|
7 postulate B : Set
|
|
|
8
|
|
|
9 data _∨_ (A B : Set) : Set where
|
|
|
10 or1 : A -> A ∨ B
|
|
|
11 or2 : B -> A ∨ B
|
|
|
12
|
|
|
13 lemma01 : A -> A ∨ B
|
|
|
14 lemma01 a = or1 a
|
|
|
15
|
|
|
16 lemma02 : B -> A ∨ B
|
|
|
17 lemma02 b = or2 b
|
|
|
18
|
|
|
19 lemma03 : {C : Set} -> (A ∨ B) -> (A -> C) -> (B -> C) -> C
|
|
|
20 lemma03 (or1 a) ac bc = ac a
|
|
|
21 lemma03 (or2 b) ac bc = bc b
|
|
|
22
|
|
|
23 postulate U : Set l
|
|
|
24 postulate V : Set l
|
|
|
25
|
|
|
26
|
|
|
27 Bool = {X : Set l} -> X -> X -> X
|
|
|
28
|
|
|
29 T : Bool
|
|
|
30 T = \{X : Set l} -> \(x y : X) -> x
|
|
|
31
|
|
|
32 F : Bool
|
|
|
33 F = \{X : Set l} -> \(x y : X) -> y
|
|
|
34
|
|
|
35 D : {U : Set l} -> U -> U -> Bool -> U
|
|
|
36 D {U} u v t = t {U} u v
|
|
|
37
|
|
|
38 lemma04 : {u v : U} -> D u v T ≡ u
|
|
|
39 lemma04 = refl
|
|
|
40
|
|
|
41 lemma05 : {u v : U} -> D u v F ≡ v
|
|
|
42 lemma05 = refl
|
|
|
43
|
|
|
44 _×_ : Set l -> Set l -> Set (suc l)
|
|
|
45 U × V = {X : Set l} -> (U -> V -> X) -> X
|
|
|
46
|
|
|
47 <_,_> : {U V : Set l} -> U -> V -> (U × V)
|
|
|
48 <_,_> {U} {V} u v = \{X} -> \(x : U -> V -> X) -> x u v
|
|
|
49
|
|
|
50 π1 : {U V : Set l} -> (U × V) -> U
|
|
|
51 π1 {U} {V} t = t {U} (\(x : U) -> \(y : V) -> x)
|
|
|
52
|
|
|
53 π2 : {U V : Set l} -> (U × V) -> V
|
|
|
54 π2 {U} {V} t = t {V} (\(x : U) -> \(y : V) -> y)
|
|
|
55
|
|
|
56 lemma06 : {U V : Set l } -> {u : U } -> {v : V} -> π1 ( < u , v > ) ≡ u
|
|
|
57 lemma06 = refl
|
|
|
58
|
|
|
59 lemma07 : {U V : Set l } -> {u : U } -> {v : V} -> π2 ( < u , v > ) ≡ v
|
|
|
60 lemma07 = refl
|
|
|
61
|
|
|
62 hoge : {U V : Set l} -> U -> V -> (U × V)
|
|
|
63 hoge u v = < u , v >
|
|
|
64
|
|
|
65 -- lemma08 : (t : U × V) -> < π1 t , π2 t > ≡ t
|
|
|
66 -- lemma08 t = {!!}
|
