Nuprl Lemma : es-prior-match_wf
∀[Info,A,B:Type]. ∀[R:A ⟶ B ⟶ 𝔹]. ∀[X:EClass(A)]. ∀[Y:EClass(B)]. (es-prior-match(R; X; Y) ∈ EClass(A × B))
Proof
Definitions occuring in Statement :
es-prior-match: es-prior-match(R; X; Y),
eclass: EClass(A[eo; e]),
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
eclass: EClass(A[eo; e]),
es-prior-match: es-prior-match(R; X; Y),
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,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
false: False,
bnot: ¬bb,
not: ¬A,
cand: A c∧ B,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[R:A {}\mrightarrow{} B {}\mrightarrow{} \mBbbB{}]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)].
(es-prior-match(R; X; Y) \mmember{} EClass(A \mtimes{} B))
Date html generated:
2016_05_17-AM-07_19_58
Last ObjectModification:
2015_12_28-PM-11_58_58
Theory : event-ordering
Home
Index