Nuprl Lemma : nysiad_message-constraint_wf

[M:ValueAllType]. ∀[actors:bag(Id)]. ∀[add2baghdr,addwaitinghdr,adeliverhdr:Atom List]. ∀[deqM:EqDecider(M)].
[inputmsghdr,kdeliverhdr,readyhdr:Atom List]. ∀[senders:bag(Id)]. ∀[tooarcasthdr:Atom List].
[waitingmap:map-sig{i:l}(Id;M)].
[mf:nysiad_headers_type{i:l}(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr)].
[msg2m:Message(mf) ⟶ M]. ∀[X:EClass(ℤ × Id × Message(mf))].
  (nysiad_message-constraint{i:l}(M;actors;add2baghdr;addwaitinghdr;adeliverhdr;deqM;...;...;...;...;...;...;mf;msg2m;X)
   ∈ ℙ')


Proof




Definitions occuring in Statement :  nysiad_message-constraint: nysiad_message-constraint{i:l}(M;actors;add2baghdr;addwaitinghdr;adeliverhdr;deqM;...;...;readyhdr;...;...;...;mf;...;X) nysiad_headers_type: nysiad_headers_type{i:l}(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr) Message: Message(f) eclass: EClass(A[eo; e]) Id: Id list: List deq: EqDecider(T) vatype: ValueAllType uall: [x:A]. B[x] prop: member: t ∈ T function: x:A ⟶ B[x] product: x:A × B[x] int: atom: Atom bag: bag(T)
Definitions unfolded in proof :  vatype: ValueAllType uall: [x:A]. B[x] member: t ∈ T nysiad_headers_type: nysiad_headers_type{i:l}(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr) name: Name subtype_rel: A ⊆B prop: and: P ∧ Q implies:  Q sq_stable: SqStable(P) l_all: (∀x∈L.P[x]) all: x:A. B[x] so_lambda: λ2x.t[x] so_apply: x[s] iff: ⇐⇒ Q nysiad_headers: nysiad_headers(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr) rev_implies:  Q guard: {T} or: P ∨ Q uimplies: supposing a nysiad_headers_fun: nysiad_headers_fun(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr;mf) bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) ifthenelse: if then else fi  cand: c∧ B nysiad_headers_no_rep: nysiad_headers_no_rep(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr) squash: T no_repeats: no_repeats(T;l) nat: le: A ≤ B less_than': less_than'(a;b) false: False not: ¬A length: ||as|| list_ind: list_ind cons: [a b] nil: [] less_than: a < b true: True ge: i ≥  satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] top: Top select: L[n] subtract: m bfalse: ff sq_type: SQType(T) bnot: ¬bb assert: b nysiad_message-constraint: nysiad_message-constraint{i:l}(M;actors;add2baghdr;addwaitinghdr;adeliverhdr;deqM;...;...;readyhdr;...;...;...;mf;...;X) label: ...$L... t

Latex:
\mforall{}[M:ValueAllType].  \mforall{}[actors:bag(Id)].  \mforall{}[add2baghdr,addwaitinghdr,adeliverhdr:Atom  List].
\mforall{}[deqM:EqDecider(M)].  \mforall{}[inputmsghdr,kdeliverhdr,readyhdr:Atom  List].  \mforall{}[senders:bag(Id)].
\mforall{}[tooarcasthdr:Atom  List].  \mforall{}[waitingmap:map-sig\{i:l\}(Id;M)].
\mforall{}[...



Date html generated: 2016_05_17-PM-01_35_37
Last ObjectModification: 2016_01_18-AM-07_28_45

Theory : event-logic-applications


Home Index