{ [V:Type]. [A:Id List]. [W:{a:Id| (a  A)}  List List].
  [x1,y1:ConsensusState]. [x2,y2:Knowledge(ConsensusState)]. [a:{a:Id| 
                                                                    (a  A)} ].
    (consensus-rel-knowledge-archive-step(V;A;W;x1;x2;y1;y2;a)  ) }

{ Proof }



Definitions occuring in Statement :  consensus-rel-knowledge-archive-step: consensus-rel-knowledge-archive-step(V;A;W;x1;x2;y1;y2;a),  consensus-state5: Knowledge(ConsensusState),  consensus-state4: ConsensusState,  Id: Id,  uall: [x:A]. B[x],  prop: ,  member: t  T,  set: {x:A| B[x]} ,  list: type List,  universe: Type,  l_member: (x  l)
Definitions :  deq: EqDecider(T),  true: True,  filter: filter(P;l),  natural_number: $n,  void: Void,  real: ,  grp_car: |g|,  subtype: S  T,  select: l[i],  length: ||as||,  nat: ,  false: False,  intensional-universe: IType,  fpf-cap: f(x)?z,  guard: {T},  implies: P  Q,  sq_type: SQType(T),  pair: <a, b>,  bool: ,  fpf-single: x : v,  int-deq: IntDeq,  fpf-join: f  g,  cs-knowledge-precondition: may consider v in inning i based on knowledge (s),  cs-estimate: Estimate(s;a),  fpf-domain: fpf-domain(f),  lambda: x.A[x],  so_lambda: x.t[x],  cs-knowledge: Knowledge(x;a),  top: Top,  union: left + right,  cs-inning: Inning(s;a),  cand: A c B,  int: ,  fpf: a:A fp-> B[a],  strong-subtype: strong-subtype(A;B),  exists: x:A. B[x],  le: A  B,  ge: i  j ,  not: A,  less_than: a < b,  uimplies: b supposing a,  product: x:A  B[x],  and: P  Q,  uiff: uiff(P;Q),  subtype_rel: A r B,  function: x:A  B[x],  all: x:A. B[x],  axiom: Ax,  consensus-rel-knowledge-archive-step: consensus-rel-knowledge-archive-step(V;A;W;x1;x2;y1;y2;a),  prop: ,  consensus-state5: Knowledge(ConsensusState),  universe: Type,  equal: s = t,  set: {x:A| B[x]} ,  l_member: (x  l),  Id: Id,  list: type List,  uall: [x:A]. B[x],  isect: x:A. B[x],  member: t  T,  consensus-state4: ConsensusState,  CollapseTHEN: Error :CollapseTHEN,  Try: Error :Try,  MaAuto: Error :MaAuto,  RepeatFor: Error :RepeatFor,  RepUR: Error :RepUR,  Auto: Error :Auto,  tactic: Error :tactic
Lemmas :  cs-inning_wf,  member_wf,  consensus-state4_wf,  top_wf,  cs-estimate_wf,  fpf-domain_wf,  l_member_wf,  not_wf,  cs-knowledge_wf,  Id_wf,  fpf_wf,  consensus-state5_wf,  subtype_rel_wf,  cs-knowledge-precondition_wf,  fpf-join_wf,  fpf-single_wf,  int-deq_wf,  intensional-universe_wf,  false_wf,  nat_wf,  fpf-domain_wf2,  length_wf1,  select_wf,  list-subtype,  fpf-type,  subtype-fpf2,  subtype-top

\mforall{}[V:Type].  \mforall{}[A:Id  List].  \mforall{}[W:\{a:Id|  (a  \mmember{}  A)\}    List  List].  \mforall{}[x1,y1:ConsensusState].
\mforall{}[x2,y2:Knowledge(ConsensusState)].  \mforall{}[a:\{a:Id|  (a  \mmember{}  A)\}  ].
    (consensus-rel-knowledge-archive-step(V;A;W;x1;x2;y1;y2;a)  \mmember{}  \mBbbP{})


Date html generated: 2011_08_16-AM-10_07_47
Last ObjectModification: 2010_12_15-PM-09_59_26

Home Index