Nuprl Lemma : process-equiv-is-equiv
∀[M:Type ⟶ Type]. EquivRel(Process(T.M[T]);P,Q.P≡Q) supposing Continuous+(T.M[T])
Proof
Definitions occuring in Statement :
process-equiv: process-equiv,
Process: Process(P.M[P]),
equiv_rel: EquivRel(T;x,y.E[x; y]),
strong-type-continuous: Continuous+(T.F[T]),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
equiv_rel: EquivRel(T;x,y.E[x; y]),
and: P ∧ Q,
refl: Refl(T;x,y.E[x; y]),
all: ∀x:A. B[x],
process-equiv: process-equiv,
so_lambda: λ2x.t[x],
so_apply: x[s],
cand: A c∧ B,
sym: Sym(T;x,y.E[x; y]),
implies: P ⇒ Q,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
prop: ℙ,
trans: Trans(T;x,y.E[x; y])
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. EquivRel(Process(T.M[T]);P,Q.P\mequiv{}Q) supposing Continuous+(T.M[T])
Date html generated:
2016_05_17-AM-10_24_07
Last ObjectModification:
2015_12_29-PM-05_27_13
Theory : process-model
Home
Index