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
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
uimplies: b supposing a
, 
process-equiv: process-equiv, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
prop: ℙ
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:
2016_05_17-AM-10_24_03
Last ObjectModification:
2015_12_29-PM-05_27_09
Theory : process-model
Home
Index