Nuprl Lemma : ma-valtype-subtype
∀[k:Knd]. ∀[da,da':a:Knd fp-> Type]. Valtype(da';k) ⊆r Valtype(da;k) supposing da ⊆ da'
Proof
Definitions occuring in Statement :
ma-valtype: Valtype(da;k),
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
Knd: Knd,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
ma-valtype: Valtype(da;k),
subtype_rel: A ⊆r B,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[k:Knd]. \mforall{}[da,da':a:Knd fp-> Type]. Valtype(da';k) \msubseteq{}r Valtype(da;k) supposing da \msubseteq{} da'
Date html generated:
2016_05_16-AM-11_38_42
Last ObjectModification:
2015_12_29-AM-09_32_06
Theory : event-ordering
Home
Index