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