Nuprl Lemma : compat-pair-lists_wf

[S,T:Type]. [x,y:(S  T) List].  (compat-pair-lists(x;y;S;T)  )


Proof not projected




Definitions occuring in Statement :  compat-pair-lists: compat-pair-lists(x;y;S;T) uall: [x:A]. B[x] prop: member: t  T product: x:A  B[x] list: type List universe: Type
Definitions :  pair: <a, b> lambda: x.A[x] l_member: (x  l) and: P  Q uimplies: b supposing a so_lambda: x.t[x] function: x:A  B[x] all: x:A. B[x] uall: [x:A]. B[x] product: x:A  B[x] isect: x:A. B[x] axiom: Ax prop: universe: Type compat-pair-lists: compat-pair-lists(x;y;S;T) equal: s = t list: type List member: t  T
Lemmas :  uall_wf l_member_wf

\mforall{}[S,T:Type].  \mforall{}[x,y:(S  \mtimes{}  T)  List].    (compat-pair-lists(x;y;S;T)  \mmember{}  \mBbbP{})


Date html generated: 2011_10_20-PM-04_58_36
Last ObjectModification: 2011_05_10-PM-05_09_54

Home Index