Nuprl Lemma : has-es-info-type-subtype
∀[T,U:Type]. ∀[f:Name ⟶ Type]. ∀[es:EO+(Message(f))]. ∀[e:E].
(has-es-info-type(es;e;f;T)) supposing (has-es-info-type(es;e;f;U) and (U ⊆r T))
Proof
Definitions occuring in Statement :
has-es-info-type: has-es-info-type(es;e;f;T),
Message: Message(f),
event-ordering+: EO+(Info),
es-E: E,
name: Name,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
has-es-info-type: has-es-info-type(es;e;f;T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
guard: {T},
subtype_rel: A ⊆r B
Latex:
\mforall{}[T,U:Type]. \mforall{}[f:Name {}\mrightarrow{} Type]. \mforall{}[es:EO+(Message(f))]. \mforall{}[e:E].
(has-es-info-type(es;e;f;T)) supposing (has-es-info-type(es;e;f;U) and (U \msubseteq{}r T))
Date html generated:
2016_05_17-AM-08_51_13
Last ObjectModification:
2015_12_29-PM-02_56_48
Theory : messages
Home
Index