0 
n=1
1 else fib(n-1)+fib(n-2) fi (recursive)
n:
. fib(n) 
j == if i=j true ; false fii,j:
. (i=j) 
q == if p true else q fip,q:. (p q) | Who Cites fib? | |
| fib | Def fib(n) == if n=0 n=1 1 else fib(n-1)+fib(n-2) fi (recursive) |
| Thm* n:. fib(n) | |
| eq_int | Def i=j == if i=j true ; false fi |
| Thm* i,j:. (i=j) | |
| bor | Def p q == if p true else q fi |
| Thm* p,q:. (p q) |
About:
 |  |  |  |  |  |  |  |
 |  |  |  |
 |