Nuprl Lemma : es-pstar-q_wf
∀[es:EO]. ∀[e1:E]. ∀[e2:{e:E| loc(e) = loc(e1) ∈ Id} ]. ∀[p,q:{e:E| loc(e) = loc(e1) ∈ Id}
─→ {e:E| loc(e) = loc(e1) ∈ Id}
─→ ℙ].
([e1;e2]~([a,b].p[a;b])*[a,b].q[a;b] ∈ ℙ)
Proof
Definitions occuring in Statement :
es-pstar-q: [e1;e2]~([a,b].p[a; b])*[a,b].q[a; b],
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ─→ B[x],
equal: s = t ∈ T
Lemmas :
exists_wf,
nat_plus_wf,
int_seg_wf,
Id_wf,
es-loc_wf,
false_wf,
lelt_wf,
es-le_wf,
subtract_wf,
decidable__le,
not-le-2,
less-iff-le,
condition-implies-le,
minus-one-mul,
zero-add,
minus-add,
minus-minus,
add-associates,
add-swap,
add-commutes,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
subtract-is-less,
all_wf,
es-locl_wf,
decidable__lt,
le-add-cancel2,
sq_stable__le,
es-E_wf,
set_wf,
event_ordering_wf,
es-pred_wf,
assert_elim,
es-first_wf2,
es-locl-first,
btrue_neq_bfalse,
assert_wf,
es-loc-pred,
iff_weakening_equal,
equal_wf
\mforall{}[es:EO]. \mforall{}[e1:E]. \mforall{}[e2:\{e:E| loc(e) = loc(e1)\} ]. \mforall{}[p,q:\{e:E| loc(e) = loc(e1)\}
{}\mrightarrow{} \{e:E| loc(e) = loc(e1)\}
{}\mrightarrow{} \mBbbP{}].
([e1;e2]\msim{}([a,b].p[a;b])*[a,b].q[a;b] \mmember{} \mBbbP{})
Date html generated:
2015_07_17-AM-08_53_35
Last ObjectModification:
2015_02_04-PM-05_56_13
Home
Index