Nuprl Lemma : simple-loc-comb-1-classrel

[Info,B,C:Type]. ∀[f:Id ⟶ B ⟶ C]. ∀[X:EClass(B)]. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:C].
  uiff(v ∈ lifting-loc-1(f)(Loc, X)(e);↓∃b:B. (b ∈ X(e) ∧ (v (f loc(e) b) ∈ C)))


Proof




Definitions occuring in Statement :  lifting-loc-1: lifting-loc-1(f) simple-loc-comb-1: F(Loc, X) classrel: v ∈ X(e) eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-loc: loc(e) es-E: E Id: Id uiff: uiff(P;Q) uall: [x:A]. B[x] exists: x:A. B[x] squash: T and: P ∧ Q apply: a function: x:A ⟶ B[x] universe: Type equal: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T lifting-loc-1: lifting-loc-1(f) simple-loc-comb-1: F(Loc, X) simple-loc-comb1: simple-loc-comb1(l,b.F[l; b];X) so_lambda: λ2x.t[x] subtype_rel: A ⊆B so_apply: x[s] so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a squash: T prop: classrel: v ∈ X(e) bag-member: x ↓∈ bs

Latex:
\mforall{}[Info,B,C:Type].  \mforall{}[f:Id  {}\mrightarrow{}  B  {}\mrightarrow{}  C].  \mforall{}[X:EClass(B)].  \mforall{}[es:EO+(Info)].  \mforall{}[e:E].  \mforall{}[v:C].
    uiff(v  \mmember{}  lifting-loc-1(f)(Loc,  X)(e);\mdownarrow{}\mexists{}b:B.  (b  \mmember{}  X(e)  \mwedge{}  (v  =  (f  loc(e)  b))))



Date html generated: 2016_05_17-AM-09_18_14
Last ObjectModification: 2016_01_17-PM-11_13_14

Theory : classrel!lemmas


Home Index