Nuprl Lemma : cond-class-val
∀[Info,A:Type]. ∀[X,Y:EClass(A)]. ∀[es:EO+(Info)]. ∀[e:E].
[X?Y](e) = if e ∈b X then X(e) else Y(e) fi ∈ A supposing ↑e ∈b [X?Y]
Proof
Definitions occuring in Statement :
cond-class: [X?Y],
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
ifthenelse: if b then t else f fi ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
eclass-val: X(e),
in-eclass: e ∈b X,
cond-class: [X?Y],
eclass-compose2: eclass-compose2(f;X;Y),
eclass: EClass(A[eo; e]),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
nat: ℕ,
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
cand: A c∧ B,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
nequal: a ≠ b ∈ T
Latex:
\mforall{}[Info,A:Type]. \mforall{}[X,Y:EClass(A)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E].
[X?Y](e) = if e \mmember{}\msubb{} X then X(e) else Y(e) fi supposing \muparrow{}e \mmember{}\msubb{} [X?Y]
Date html generated:
2016_05_16-PM-02_33_13
Last ObjectModification:
2016_01_17-PM-07_30_13
Theory : event-ordering
Home
Index