Nuprl Lemma : eclass-disju-program_wf

[Info,A,B:Type]. ∀[X:EClass(A)]. ∀[Y:EClass(B)]. ∀[xpr:LocalClass(X)]. ∀[ypr:LocalClass(Y)].
  (xpr ypr ∈ LocalClass(X Y)) supposing (valueall-type(A) and valueall-type(B))


Proof




Definitions occuring in Statement :  eclass-disju-program: xpr ypr eclass-disju: Y local-class: LocalClass(X) eclass: EClass(A[eo; e]) valueall-type: valueall-type(T) uimplies: supposing a uall: [x:A]. B[x] member: t ∈ T union: left right universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a eclass-disju-program: xpr ypr eclass-disju: Y implies:  Q prop: so_lambda: λ2y.t[x; y] subtype_rel: A ⊆B so_apply: x[s1;s2]

Latex:
\mforall{}[Info,A,B:Type].  \mforall{}[X:EClass(A)].  \mforall{}[Y:EClass(B)].  \mforall{}[xpr:LocalClass(X)].  \mforall{}[ypr:LocalClass(Y)].
    (xpr  +  ypr  \mmember{}  LocalClass(X  +  Y))  supposing  (valueall-type(A)  and  valueall-type(B))



Date html generated: 2016_05_17-AM-09_09_32
Last ObjectModification: 2015_12_29-PM-03_35_12

Theory : local!classes


Home Index