Nuprl Lemma : pircv?_wf
∀[v:pi_prefix()]. (pircv?(v) ∈ 𝔹)
Proof
Definitions occuring in Statement :
pircv?: pircv?(v),
pi_prefix: pi_prefix(),
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
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),
uimplies: b supposing a,
sq_type: SQType(T),
guard: {T},
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
pisend: pisend(chan;var),
pircv?: pircv?(v),
pi1: fst(t),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
bnot: ¬bb,
assert: ↑b,
false: False,
pircv: pircv(chan;var)
Latex:
\mforall{}[v:pi\_prefix()]. (pircv?(v) \mmember{} \mBbbB{})
Date html generated:
2016_05_17-AM-11_20_05
Last ObjectModification:
2015_12_29-PM-06_58_29
Theory : event-logic-applications
Home
Index