Q == (P 
Q) & (P Q)
A,B:Prop. (A B) 
Prop
== {i:
| 0
i } Type
0
x,y. x = y T else x,y. 
z:T. (x R z) & (z R^n-1 y) fi
Def (recursive)
n:, T:Type, R:(T
TProp). R^n TTPropT1,T2:Type, R:(T1T2Prop). R^-1 T2T1Prop| Some definitions of interest. | |
| iff | Q == (P Q) & (P Q) |
| A,B:Prop. (A B) Prop | |
| nat | == {i:| 0i } |
| Type | |
| rel_exp | 0 x,y. x = y T else x,y. z:T. (x R z) & (z R^n-1 y) fi
Def (recursive) |
| n:, T:Type, R:(TTProp). R^n TTProp | |
| rel_inverse | |
| T1,T2:Type, R:(T1T2Prop). R^-1 T2T1Prop |
About:
 |  |  |  |  |  |
 |  |  |  |  |  |
 |  |  |  |  |  |