Nuprl Lemma : es-interface-subtype_rel2
∀[Info:Type]. ∀[A,B:es:EO+(Info) ⟶ E ⟶ Type].
EClass(A[es;e]) ⊆r EClass(B[es;e]) supposing ∀es:EO+(Info). ∀e:E. (A[es;e] ⊆r B[es;e])
Proof
Definitions occuring in Statement :
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
so_apply: x[s1;s2],
all: ∀x:A. B[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
subtype_rel: A ⊆r B,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x]
Latex:
\mforall{}[Info:Type]. \mforall{}[A,B:es:EO+(Info) {}\mrightarrow{} E {}\mrightarrow{} Type].
EClass(A[es;e]) \msubseteq{}r EClass(B[es;e]) supposing \mforall{}es:EO+(Info). \mforall{}e:E. (A[es;e] \msubseteq{}r B[es;e])
Date html generated:
2016_05_16-PM-02_33_34
Last ObjectModification:
2015_12_29-AM-11_34_57
Theory : event-ordering
Home
Index