Nuprl Lemma : pair-prior-val
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[A,B:Type]. ∀[X:EClass(A)]. ∀[Y:EClass(B)]. ∀[e:E]. X;Y(e) ~ <(X)'(e), Y(e)> supposing \000C↑e ∈b X;Y
Proof
Definitions occuring in Statement :
es-interface-pair-prior: X;Y,
es-prior-val: (X)',
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
pair: <a, b>,
universe: Type,
sqequal: s ~ t
Lemmas :
is-pair-prior,
es-interface-subtype_rel2,
es-E_wf,
event-ordering+_subtype,
top_wf,
in-eclass_wf,
es-prior-val_wf,
bool_wf,
eqtt_to_assert,
bag_only_single_lemma,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
uiff_transitivity,
equal-wf-T-base,
assert_wf,
bnot_wf,
not_wf,
assert_of_bnot,
es-interface-pair-prior_wf,
event-ordering+_wf,
subtype_top,
eclass_wf
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[A,B:Type]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)]. \mforall{}[e:E].
X;Y(e) \msim{} <(X)'(e), Y(e)> supposing \muparrow{}e \mmember{}\msubb{} X;Y
Date html generated:
2015_07_21-PM-03_47_39
Last ObjectModification:
2015_01_27-PM-06_24_41
Home
Index