Nuprl Lemma : base-process-class_wf
∀[f:Name ⟶ Type]. ∀[Info,T:Type]. ∀[X:EClass(T)]. ∀[loc:Id]. ∀[hdr:Name].
base-process-class(X;loc;hdr) ∈ EClass(T) supposing hdr encodes Id × Info
Proof
Definitions occuring in Statement :
base-process-class: base-process-class(X;loc;hdr),
encodes-msg-type: hdr encodes T,
Message: Message(f),
eclass: EClass(A[eo; e]),
Id: Id,
name: Name,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
base-process-class: base-process-class(X;loc;hdr),
eclass: EClass(A[eo; e]),
let: let,
class-ap: X(e),
encodes-msg-type: hdr encodes T,
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
false: False,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
listp: A List+,
int_seg: {i..j-},
lelt: i ≤ j < k,
decidable: Dec(P),
less_than: a < b,
squash: ↓T,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A
Latex:
\mforall{}[f:Name {}\mrightarrow{} Type]. \mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[loc:Id]. \mforall{}[hdr:Name].
base-process-class(X;loc;hdr) \mmember{} EClass(T) supposing hdr encodes Id \mtimes{} Info
Date html generated:
2016_05_17-AM-08_52_52
Last ObjectModification:
2016_01_17-PM-08_35_15
Theory : messages
Home
Index