Nuprl Lemma : es-E-subtype
∀[es:EO]. strong-subtype(E;es-base-E(es))
Proof
Definitions occuring in Statement :
es-E: E,
es-base-E: es-base-E(es),
event_ordering: EO,
strong-subtype: strong-subtype(A;B),
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-E: E,
es-dom: es-dom(es),
es-base-E: es-base-E(es),
so_lambda: λ2x.t[x],
so_apply: x[s],
implies: P ⇒ Q
Latex:
\mforall{}[es:EO]. strong-subtype(E;es-base-E(es))
Date html generated:
2016_05_16-AM-09_13_56
Last ObjectModification:
2015_12_28-PM-09_58_28
Theory : new!event-ordering
Home
Index