Nuprl Lemma : member-memory-class3
∀[Info,A1,A2,A3,B:Type]. ∀[init:Id ⟶ B]. ∀[tr1:Id ⟶ A1 ⟶ B ⟶ B]. ∀[X1:EClass(A1)]. ∀[tr2:Id ⟶ A2 ⟶ B ⟶ B].
∀[X2:EClass(A2)]. ∀[tr3:Id ⟶ A3 ⟶ B ⟶ B]. ∀[X3:EClass(A3)]. ∀[es:EO+(Info)]. ∀[e:E].
(e ∈b memory-class3(init;tr1;X1;tr2;X2;tr3;X3) ~ tt)
Proof
Definitions occuring in Statement :
memory-class3: memory-class3(init;tr1;X1;tr2;X2;tr3;X3),
member-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
Id: Id,
btrue: tt,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
memory-class3: memory-class3(init;tr1;X1;tr2;X2;tr3;X3),
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
top: Top,
lt_int: i <z j,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info,A1,A2,A3,B:Type]. \mforall{}[init:Id {}\mrightarrow{} B]. \mforall{}[tr1:Id {}\mrightarrow{} A1 {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[X1:EClass(A1)]. \mforall{}[tr2:Id
{}\mrightarrow{} A2
{}\mrightarrow{} B
{}\mrightarrow{} B].
\mforall{}[X2:EClass(A2)]. \mforall{}[tr3:Id {}\mrightarrow{} A3 {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[X3:EClass(A3)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E].
(e \mmember{}\msubb{} memory-class3(init;tr1;X1;tr2;X2;tr3;X3) \msim{} tt)
Date html generated:
2016_05_17-AM-11_15_35
Last ObjectModification:
2015_12_29-PM-05_12_17
Theory : process-model
Home
Index