Nuprl Lemma : fulpRunType-subtype

[M:Type ⟶ Type]. (fulpRunType(T.M[T]) ⊆pRunType(T.M[T]))


Proof




Definitions occuring in Statement :  pRunType: pRunType(T.M[T]) fulpRunType: fulpRunType(T.M[T]) subtype_rel: A ⊆B 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 fulpRunType: fulpRunType(T.M[T]) pRunType: pRunType(T.M[T]) so_lambda: λ2x.t[x] so_apply: x[s] uimplies: supposing a subtype_rel: A ⊆B all: x:A. B[x] System: System(P.M[P]) top: Top

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  (fulpRunType(T.M[T])  \msubseteq{}r  pRunType(T.M[T]))



Date html generated: 2016_05_17-AM-10_39_53
Last ObjectModification: 2015_12_29-PM-05_24_57

Theory : process-model


Home Index