Nuprl Lemma : pa-useable_wf
∀[pa:ProtocolAction]. (pa-useable(pa) ∈ Atom1 List)
Proof
Definitions occuring in Statement :
pa-useable: pa-useable(pa),
protocol-action: ProtocolAction,
list: T List,
atom: Atom$n,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
protocol-action: ProtocolAction,
pa-useable: pa-useable(pa),
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,
ifthenelse: if b then t else f fi ,
sq_type: SQType(T),
guard: {T},
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
bnot: ¬bb,
assert: ↑b,
false: False,
eq_atom: x =a y,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
top: Top
Latex:
\mforall{}[pa:ProtocolAction]. (pa-useable(pa) \mmember{} Atom1 List)
Date html generated:
2016_05_17-PM-00_37_53
Last ObjectModification:
2015_12_29-PM-06_33_29
Theory : event-logic-applications
Home
Index