Nuprl Lemma : strong-subtype-eo-forward-E
∀[eo:EO]. ∀[e:E]. strong-subtype(E;E)
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
es-E: E,
event_ordering: EO,
strong-subtype: strong-subtype(A;B),
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
es-E: E,
es-dom: es-dom(es),
es-base-E: es-base-E(es),
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
eo-forward: eo.e,
eo-restrict: eo-restrict(eo;P),
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
btrue: tt,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
and: P ∧ Q,
band: p ∧b q,
assert: ↑b,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
false: False,
true: True
Latex:
\mforall{}[eo:EO]. \mforall{}[e:E]. strong-subtype(E;E)
Date html generated:
2016_05_16-PM-01_04_58
Last ObjectModification:
2015_12_29-PM-01_47_15
Theory : event-ordering
Home
Index