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

`∀[Info,B,C:Type]. ∀[f:B ─→ C]. ∀[X:EClass(B)]. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:C].`
`  uiff(v ∈ lifting-1(f)|X|(e);↓∃b:B. ((v = (f b) ∈ C) ∧ b ∈ X(e)))`

Proof

Definitions occuring in Statement :  simple-comb-1: `F|X|` classrel: `v ∈ X(e)` eclass: `EClass(A[eo; e])` event-ordering+: `EO+(Info)` es-E: `E` uiff: `uiff(P;Q)` uall: `∀[x:A]. B[x]` exists: `∃x:A. B[x]` squash: `↓T` and: `P ∧ Q` apply: `f a` function: `x:A ─→ B[x]` universe: `Type` equal: `s = t ∈ T` lifting-1: `lifting-1(f)`
Lemmas :  simple-comb1-classrel classrel_wf simple-comb_wf false_wf le_wf select_wf cons_wf nil_wf sq_stable__le length_wf length_nil non_neg_length length_wf_nil length_cons length_wf_nat int_seg_wf es-interface-subtype_rel2 es-E_wf event-ordering+_subtype subtype_rel-equal select-cons-hd decidable__le not-le-2 less-iff-le condition-implies-le add-commutes minus-add minus-zero zero-add add_functionality_wrt_le add-associates le-add-cancel2 lifting1_wf lelt_wf bag_wf squash_wf exists_wf event-ordering+_wf eclass_wf

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

Date html generated: 2015_07_22-PM-00_11_00
Last ObjectModification: 2015_01_28-AM-11_41_21

Home Index