Nuprl Lemma : nysiad_QueueState-program_wf
∀[add2baghdr,addwaitinghdr,adeliverhdr,inputmsghdr,kdeliverhdr,readyhdr,tooarcasthdr:Atom List].
∀[mf:nysiad_headers_type{i:l}(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr)].
(nysiad_QueueState-program(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr;mf)
∈ ∀x:Id
LocalClass(nysiad_QueueState(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;...;mf)
x))
Proof
Definitions occuring in Statement :
nysiad_QueueState-program: nysiad_QueueState-program(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr;mf),
nysiad_QueueState: nysiad_QueueState(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr;mf),
nysiad_headers_type: nysiad_headers_type{i:l}(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr),
Message: Message(f),
local-class: LocalClass(X),
Id: Id,
list: T List,
bool: 𝔹,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
unit: Unit,
member: t ∈ T,
apply: f a,
product: x:A × B[x],
union: left + right,
atom: Atom
Definitions unfolded in proof :
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 ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
vatype: ValueAllType,
prop: ℙ,
and: P ∧ Q,
implies: P ⇒ Q,
sq_stable: SqStable(P),
l_all: (∀x∈L.P[x]),
iff: P ⇐⇒ Q,
nysiad_headers: nysiad_headers(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr),
rev_implies: P ⇐ Q,
guard: {T},
or: P ∨ Q,
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 b then t else f fi ,
cand: A 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 ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
select: L[n],
subtract: n - m,
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
nysiad_QueueState: nysiad_QueueState(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr;mf),
nysiad_QueueState-program: nysiad_QueueState-program(add2baghdr;addwaitinghdr;adeliverhdr;inputmsghdr;kdeliverhdr;readyhdr;tooarcasthdr;mf)
Latex:
\mforall{}[add2baghdr,addwaitinghdr,adeliverhdr,inputmsghdr,kdeliverhdr,readyhdr,tooarcasthdr:Atom List].
\mforall{}[...
Date html generated:
2016_05_17-PM-01_28_42
Last ObjectModification:
2016_01_18-AM-07_26_18
Theory : event-logic-applications
Home
Index