Nuprl Lemma : decidable__path-goes-thru
∀[Info:Type]. ∀es:EO+(Info). ∀Sys:EClass(Top). ∀f:sys-antecedent(es;Sys). ∀y,x:E(Sys). ∀i:Id. Dec(x-f*-y thru i)
Proof
Definitions occuring in Statement :
path-goes-thru: x-f*-y thru i,
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
Id: Id,
decidable: Dec(P),
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
universe: Type
Lemmas :
es-causl-swellfnd,
event-ordering+_subtype,
less_than_transitivity1,
less_than_irreflexivity,
int_seg_wf,
decidable__equal_int,
subtype_rel-int_seg,
false_wf,
le_weakening,
subtract_wf,
int_seg_properties,
le_wf,
nat_wf,
zero-le-nat,
lelt_wf,
es-causl_wf,
equal_wf,
es-E-interface_wf,
all_wf,
int_seg_subtype-nat,
Id_wf,
decidable_wf,
path-goes-thru_wf,
decidable__lt,
not-equal-2,
condition-implies-le,
minus-add,
minus-minus,
minus-one-mul,
add-swap,
add-commutes,
add-associates,
add_functionality_wrt_le,
zero-add,
le-add-cancel-alt,
less-iff-le,
le-add-cancel,
set_wf,
less_than_wf,
primrec-wf2,
decidable__le,
not-le-2,
sq_stable__le,
add-zero,
add-mul-special,
zero-mul,
sys-antecedent_wf,
eclass_wf,
top_wf,
es-E_wf,
event-ordering+_wf,
decidable__equal_Id,
es-loc_wf,
decidable__fun-connected,
sys-antecedent-retraction,
decidable__equal_es-E-interface,
not_wf,
fun-connected-test2,
fun-connected_wf,
fun-connected_transitivity,
fun-connected-fixedpoint,
and_wf,
sq_stable__es-causl,
in-eclass_wf,
assert_elim,
subtype_base_sq,
bool_wf,
bool_subtype_base,
assert_wf,
fun-connected-step,
fun-connected-step-back
Latex:
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}Sys:EClass(Top). \mforall{}f:sys-antecedent(es;Sys). \mforall{}y,x:E(Sys). \mforall{}i:Id.
Dec(x-f*-y thru i)
Date html generated:
2015_07_21-PM-04_17_01
Last ObjectModification:
2015_07_16-AM-10_05_23
Home
Index