Nuprl Lemma : Memory2-memory-class2
∀[Info,A1,A2,S:Type]. ∀[init:Id ⟶ S]. ∀[tr1:Id ⟶ A1 ⟶ S ⟶ S]. ∀[X1:EClass(A1)]. ∀[tr2:Id ⟶ A2 ⟶ S ⟶ S].
∀[X2:EClass(A2)].
(Memory2(init;tr1;X1;tr2;X2) = memory-class2(init;tr1;X1;tr2;X2) ∈ EClass(S))
Proof
Definitions occuring in Statement :
Memory2: Memory2(init;tr1;X1;tr2;X2),
memory-class2: memory-class2(init;tr1;X1;tr2;X2),
eclass: EClass(A[eo; e]),
Id: Id,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
Memory2: Memory2(init;tr1;X1;tr2;X2),
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
uimplies: b supposing a,
guard: {T},
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
State2: State2(init;tr1;X1;tr2;X2),
squash: ↓T,
prop: ℙ,
true: True,
memory-class2: memory-class2(init;tr1;X1;tr2;X2),
state-class2: state-class2(init;tr1;X1;tr2;X2)
Latex:
\mforall{}[Info,A1,A2,S:Type]. \mforall{}[init:Id {}\mrightarrow{} S]. \mforall{}[tr1:Id {}\mrightarrow{} A1 {}\mrightarrow{} S {}\mrightarrow{} S]. \mforall{}[X1:EClass(A1)]. \mforall{}[tr2:Id
{}\mrightarrow{} A2
{}\mrightarrow{} S
{}\mrightarrow{} S].
\mforall{}[X2:EClass(A2)].
(Memory2(init;tr1;X1;tr2;X2) = memory-class2(init;tr1;X1;tr2;X2))
Date html generated:
2016_05_17-AM-10_05_41
Last ObjectModification:
2016_01_17-PM-11_02_38
Theory : classrel!lemmas
Home
Index