Nuprl Lemma : process-equiv_wf
∀[M:Type ─→ Type]. ∀[P,Q:Process(T.M[T])]. (P≡Q ∈ ℙ) supposing Continuous+(T.M[T])
Proof
Definitions occuring in Statement :
process-equiv: process-equiv,
Process: Process(P.M[P]),
strong-type-continuous: Continuous+(T.F[T]),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
member: t ∈ T,
function: x:A ─→ B[x],
universe: Type
Lemmas :
all_wf,
list_wf,
pMsg_wf,
equal_wf,
pExt_wf,
Process-stream_wf,
Process_wf,
strong-type-continuous_wf
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[P,Q:Process(T.M[T])]. (P\mequiv{}Q \mmember{} \mBbbP{}) supposing Continuous+(T.M[T])
Date html generated:
2015_07_23-AM-11_07_27
Last ObjectModification:
2015_01_29-AM-00_09_57
Home
Index