Nuprl Lemma : run_local_pred_loc
∀[M:Type ─→ Type]. ∀r:pRunType(P.M[P]). ∀e:runEvents(r). ((snd(run_local_pred(r;e))) = (snd(e)) ∈ Id)
Proof
Definitions occuring in Statement :
run_local_pred: run_local_pred(r;e),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
Id: Id,
uall: ∀[x:A]. B[x],
so_apply: x[s],
pi2: snd(t),
all: ∀x:A. B[x],
function: x:A ─→ B[x],
universe: Type,
equal: s = t ∈ T
Lemmas :
runEvents_wf,
pRunType_wf,
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
decidable__le,
subtract_wf,
false_wf,
not-ge-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,
eq_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_int,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_int,
value-type-has-value,
int-value-type,
is-run-event_wf,
not-le-2,
not-equal-2,
le_wf,
nat_wf,
Id_wf,
iff_weakening_equal
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}r:pRunType(P.M[P]). \mforall{}e:runEvents(r). ((snd(run\_local\_pred(r;e))) = (snd(e)))
Date html generated:
2015_07_23-AM-11_15_07
Last ObjectModification:
2015_02_04-PM-04_47_06
Home
Index