0
b else c(n-1,primrec(n-1;b;c)) fi (recursive)
T:Type, n:
, b:T, c:(n
TT). primrec(n;b;c) 
Tj == if i=j true ; false fii,j:
. (i=j) 
} == {k:| i 
k < j }m,n:. {m..n} Type
A == A 
FalseA:Prop. (A) Prop| Some definitions of interest. | |
| primrec | 0 b else c(n-1,primrec(n-1;b;c)) fi (recursive) |
| T:Type, n:, b:T, c:(nTT). primrec(n;b;c) T | |
| eq_int | j == if i=j true ; false fi |
| i,j:. (i=j) | |
| int_seg | } == {k:| i k < j } |
| m,n:. {m..n} Type | |
| not | A == A False |
| A:Prop. (A) Prop |
About:
 |  |  |  |  |  |  |
 |  |  |  |
 |  |  |  |  |  |
 |  |