Nuprl Lemma : simple-comb_wf

[Info,B:Type]. ∀[n:ℕ]. ∀[A:ℕn ⟶ Type]. ∀[Xs:k:ℕn ⟶ EClass(A k)]. ∀[F:(k:ℕn ⟶ bag(A k)) ⟶ bag(B)].
  (simple-comb(F;Xs) ∈ EClass(B))


Proof




Definitions occuring in Statement :  simple-comb: simple-comb(F;Xs) eclass: EClass(A[eo; e]) int_seg: {i..j-} nat: uall: [x:A]. B[x] member: t ∈ T apply: a function: x:A ⟶ B[x] natural_number: $n universe: Type bag: bag(T)
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T simple-comb: simple-comb(F;Xs) eclass: EClass(A[eo; e]) subtype_rel: A ⊆B so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] nat:

Latex:
\mforall{}[Info,B:Type].  \mforall{}[n:\mBbbN{}].  \mforall{}[A:\mBbbN{}n  {}\mrightarrow{}  Type].  \mforall{}[Xs:k:\mBbbN{}n  {}\mrightarrow{}  EClass(A  k)].
\mforall{}[F:(k:\mBbbN{}n  {}\mrightarrow{}  bag(A  k))  {}\mrightarrow{}  bag(B)].
    (simple-comb(F;Xs)  \mmember{}  EClass(B))



Date html generated: 2016_05_16-PM-02_17_24
Last ObjectModification: 2015_12_29-AM-11_46_11

Theory : event-ordering


Home Index