Nuprl Lemma : eclass_subtype_rel

[T,A,B:Type].  EClass(A) ⊆EClass(B) supposing A ⊆B


Proof




Definitions occuring in Statement :  eclass: EClass(A[eo; e]) uimplies: supposing a subtype_rel: A ⊆B uall: [x:A]. B[x] universe: Type
Definitions unfolded in proof :  eclass: EClass(A[eo; e]) uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a so_lambda: λ2x.t[x] subtype_rel: A ⊆B so_apply: x[s] all: x:A. B[x]

Latex:
\mforall{}[T,A,B:Type].    EClass(A)  \msubseteq{}r  EClass(B)  supposing  A  \msubseteq{}r  B



Date html generated: 2016_05_16-PM-01_27_03
Last ObjectModification: 2015_12_29-PM-02_04_01

Theory : event-ordering


Home Index