Nuprl Lemma : es-propagation-rule-iff_wf
∀[Info,A,B:Type]. ∀[X:EClass(A)]. ∀[Y:EClass(B)]. ∀[f:Id ⟶ A ⟶ B]. ∀[g:A ⟶ (Id List)]. ∀[es:EO+(Info)].
(X ⇐f⇒ Y@g ∈ ℙ)
Proof
Definitions occuring in Statement :
es-propagation-rule-iff: A ⇐f⇒ B@g,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
Id: Id,
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-propagation-rule-iff: A ⇐f⇒ B@g,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
implies: P ⇒ Q,
es-E-interface: E(X),
so_apply: x[s],
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
exists: ∃x:A. B[x]
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)]. \mforall{}[f:Id {}\mrightarrow{} A {}\mrightarrow{} B]. \mforall{}[g:A {}\mrightarrow{} (Id List)].
\mforall{}[es:EO+(Info)].
(X \mLeftarrow{}{}f{}\mRightarrow{} Y@g \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-06_49_13
Last ObjectModification:
2015_12_29-AM-00_24_03
Theory : event-ordering
Home
Index