== {x:| prime(x) } == {i:
| 0
i } 
Type
a = 0 & (a ~ 1) & (
b,c:. a | b
c 
a | b 
a | c)a:. prime(a) PropA == A FalseA:Prop. (A) Prop
f(x) else 0 fif:(Prime
). prime_mset_complete(f) | Some definitions of interest. | |
| prime_nats | == {x:| prime(x) } |
| nat | == {i:| 0i } |
| Type | |
| prime | a = 0 & (a ~ 1) & (b,c:. a | bc a | b a | c) |
| a:. prime(a) Prop | |
| not | A == A False |
| A:Prop. (A) Prop | |
| prime_mset_complete | f(x) else 0 fi |
| f:(Prime). prime_mset_complete(f) |
About:
 |  |  |  |  |  |  |  |
 |  |  |  |  |  |  |  |  |