Nuprl Lemma : es-E-interfaces-strong-subtype

[Info:Type]. ∀[es:EO+(Info)]. ∀[X,Y:EClass(Top)].  uiff(E(X) ⊆E(Y);strong-subtype(E(X);E(Y)))


Proof




Definitions occuring in Statement :  es-E-interface: E(X) eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) strong-subtype: strong-subtype(A;B) uiff: uiff(P;Q) subtype_rel: A ⊆B uall: [x:A]. B[x] top: Top universe: Type
Definitions unfolded in proof :  uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a member: t ∈ T uall: [x:A]. B[x] implies:  Q subtype_rel: A ⊆B prop: so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] strong-subtype: strong-subtype(A;B) cand: c∧ B so_lambda: λ2x.t[x] so_apply: x[s] exists: x:A. B[x] es-E-interface: E(X) sq_type: SQType(T) all: x:A. B[x] guard: {T} assert: b ifthenelse: if then else fi  btrue: tt true: True

Latex:
\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[X,Y:EClass(Top)].    uiff(E(X)  \msubseteq{}r  E(Y);strong-subtype(E(X);E(Y)))



Date html generated: 2016_05_16-PM-02_51_19
Last ObjectModification: 2015_12_29-AM-11_24_43

Theory : event-ordering


Home Index