Nuprl Lemma : pinew-name_wf
∀[v:pi_term()]. pinew-name(v) ∈ Name supposing ↑pinew?(v)
Proof
Definitions occuring in Statement :
pinew-name: pinew-name(v),
pinew?: pinew?(v),
pi_term: pi_term(),
name: Name,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
ext-eq: A ≡ B,
and: P ∧ Q,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
sq_type: SQType(T),
guard: {T},
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
pinew?: pinew?(v),
pi1: fst(t),
assert: ↑b,
bfalse: ff,
false: False,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
bnot: ¬bb,
pinew-name: pinew-name(v),
pi2: snd(t)
Latex:
\mforall{}[v:pi\_term()]. pinew-name(v) \mmember{} Name supposing \muparrow{}pinew?(v)
Date html generated:
2016_05_17-AM-11_22_26
Last ObjectModification:
2015_12_29-PM-06_54_55
Theory : event-logic-applications
Home
Index