Nuprl Lemma : pi_termco-ext
pi_termco() ≡ lbl:Atom × if lbl =a "zero" then Unit
if lbl =a "comm" then pre:pi_prefix() × pi_termco()
if lbl =a "option" then left:pi_termco() × pi_termco()
if lbl =a "par" then left:pi_termco() × pi_termco()
if lbl =a "rep" then pi_termco()
if lbl =a "new" then name:Name × pi_termco()
else Void
fi
Proof
Definitions occuring in Statement :
pi_termco: pi_termco(),
pi_prefix: pi_prefix(),
name: Name,
ifthenelse: if b then t else f fi ,
eq_atom: x =a y,
ext-eq: A ≡ B,
unit: Unit,
product: x:A × B[x],
token: "$token",
atom: Atom,
void: Void
Definitions unfolded in proof :
pi_termco: pi_termco(),
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
member: t ∈ T,
so_apply: x[s],
uimplies: b supposing a,
continuous-monotone: ContinuousMonotone(T.F[T]),
and: P ∧ Q,
type-monotone: Monotone(T.F[T]),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
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],
strong-type-continuous: Continuous+(T.F[T]),
type-continuous: Continuous(T.F[T])
Latex:
pi\_termco() \mequiv{} lbl:Atom \mtimes{} if lbl =a "zero" then Unit
if lbl =a "comm" then pre:pi\_prefix() \mtimes{} pi\_termco()
if lbl =a "option" then left:pi\_termco() \mtimes{} pi\_termco()
if lbl =a "par" then left:pi\_termco() \mtimes{} pi\_termco()
if lbl =a "rep" then pi\_termco()
if lbl =a "new" then name:Name \mtimes{} pi\_termco()
else Void
fi
Date html generated:
2016_05_17-AM-11_20_32
Last ObjectModification:
2015_12_29-PM-06_59_17
Theory : event-logic-applications
Home
Index