Nuprl Lemma : loc-Server_wf
∀[f:(Id List) ⟶ Id]. ∀[L:Id List]. ∀[n:ℕ]. (loc-Server(f;L;n) ∈ Process(P.piM(P)))
Proof
Definitions occuring in Statement :
loc-Server: loc-Server(f;L0;n0),
piM: piM(T),
Process: Process(P.M[P]),
Id: Id,
list: T List,
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
loc-Server: loc-Server(f;L0;n0),
let: let,
so_lambda: λ2x y.t[x; y],
piM: piM(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
nat: ℕ,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
type-monotone: Monotone(T.F[T]),
subtype_rel: A ⊆r B,
pi-process: pi-process(),
sq_stable: SqStable(P),
squash: ↓T,
PiDataVal: PiDataVal(),
pMsg: pMsg(P.M[P]),
bfalse: ff,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
so_apply: x[s1;s2]
Latex:
\mforall{}[f:(Id List) {}\mrightarrow{} Id]. \mforall{}[L:Id List]. \mforall{}[n:\mBbbN{}]. (loc-Server(f;L;n) \mmember{} Process(P.piM(P)))
Date html generated:
2016_05_17-AM-11_35_55
Last ObjectModification:
2016_01_18-AM-07_46_19
Theory : event-logic-applications
Home
Index