Q == (P 
Q) & (P Q)
A,B:Prop. (A B) 
Propx:T. 
((x l1) & (x l2))T:Type, l,l':T List. l_disjoint(T;l;l') Prop l) == 
i:
. i < ||l|| & x = l[i] TT:Type, x:T, l:T List. (x l) PropA == A FalseA:Prop. (A) Prop| Some definitions of interest. | |
| iff | Def P Q == (P Q) & (P Q) |
| Thm* A,B:Prop. (A B) Prop | |
| l_disjoint | Def l_disjoint(T;l1;l2) == x:T. ((x l1) & (x l2)) |
| Thm* T:Type, l,l':T List. l_disjoint(T;l;l') Prop | |
| l_member | Def (x l) == i:. i < ||l|| & x = l[i] T |
| Thm* T:Type, x:T, l:T List. (x l) Prop | |
| not | Def A == A False |
| Thm* A:Prop. (A) Prop |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |