Nuprl Lemma : es-interface-predecessors-last
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e:E(X)]. ((¬↑null(≤(X)(e))) ∧ (last(≤(X)(e)) = e ∈ E(X)))
Proof
Definitions occuring in Statement :
es-interface-predecessors: ≤(X)(e),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
last: last(L),
null: null(as),
assert: ↑b,
uall: ∀[x:A]. B[x],
top: Top,
not: ¬A,
and: P ∧ Q,
universe: Type,
equal: s = t ∈ T
Lemmas :
assert_functionality_wrt_uiff,
null_wf3,
es-interface-predecessors_wf,
subtype_rel_list,
Id_wf,
es-loc_wf,
event-ordering+_subtype,
top_wf,
in-eclass_wf,
es-prior-interface_wf0,
es-interface-subtype_rel2,
es-E_wf,
subtype_top,
bool_wf,
eqtt_to_assert,
append_wf,
eclass-val_wf2,
es-prior-interface_wf,
cons_wf,
nil_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
squash_wf,
true_wf,
list_wf,
es-interface-predecessors-step,
assert_wf,
not_wf,
null_cons_lemma,
es-E-interface_wf,
eclass_wf,
event-ordering+_wf,
equal-wf-T-base,
bnot_wf,
bfalse_wf,
assert_elim,
btrue_neq_bfalse,
es-E-interface-property,
last_wf,
list_ind_nil_lemma,
es-interface-predecessors-general-step,
not_assert_elim,
and_wf,
ifthenelse_wf,
ite_rw_true,
last_singleton_append,
last_singleton,
iff_weakening_equal,
uiff_transitivity,
assert_of_bnot,
null_append,
assert_of_null,
false_wf,
null_nil_lemma,
btrue_wf
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[e:E(X)].
((\mneg{}\muparrow{}null(\mleq{}(X)(e))) \mwedge{} (last(\mleq{}(X)(e)) = e))
Date html generated:
2015_07_21-PM-03_34_48
Last ObjectModification:
2015_02_04-PM-06_15_06
Home
Index