{ [Info,T:Type]. [X:EClass(T)].  (((X))' = (X)') }

{ Proof }



Definitions occuring in Statement :  es-latest-val: (X) es-prior-val: (X)' eclass: EClass(A[eo; e]) uall: [x:A]. B[x] universe: Type equal: s = t
Definitions :  so_lambda: x.t[x] rev_implies: P  Q implies: P  Q cand: A c B and: P  Q exists: x:A. B[x] iff: P  Q all: x:A. B[x] prop: member: t  T guard: {T} or: P  Q es-le: e loc e'  true: True squash: T so_lambda: x y.t[x; y] top: Top so_apply: x[s1;s2] ifthenelse: if b then t else f fi  btrue: tt assert: b so_apply: x[s] uimplies: b supposing a uall: [x:A]. B[x] es-locl: (e <loc e') sq_type: SQType(T) false: False not: A decidable: Dec(P) subtype: S  T
Lemmas :  is-latest-val and_functionality_wrt_iff exists_functionality_wrt_iff iff_transitivity is-prior-val iff_functionality_wrt_iff all_functionality_wrt_iff es-le_wf es-locl_wf es-latest-val_wf es-interface-top top_wf es-prior-val_wf in-eclass_wf assert_wf iff_wf event-ordering+_inc es-E_wf event-ordering+_wf es-locl_transitivity1 prior-val-val latest-val-cases eclass_wf squash_wf eclass-val_wf es-interface-subtype_rel2 es-locl-total assert_elim bool_subtype_base bool_wf subtype_base_sq has-latest-val decidable__es-le es-le-not-locl decidable__es-locl true_wf not_assert_elim btrue_neq_bfalse es-le_weakening es-locl_transitivity2

\mforall{}[Info,T:Type].  \mforall{}[X:EClass(T)].    (((X)\msupminus{})'  =  (X)')


Date html generated: 2011_08_16-PM-06_04_29
Last ObjectModification: 2011_06_20-AM-01_47_25

Home Index