Nuprl Lemma : graph-rcvset_wf
∀[a:Id ⟶ Id ⟶ Id]. ∀[b:Id]. ∀[S:Id List]. ∀[G:Graph(S)]. ∀[k:Knd]. (graph-rcvset(a;b;S;G;k) ∈ 𝔹)
Proof
Definitions occuring in Statement :
graph-rcvset: graph-rcvset(a;b;S;G;k),
Knd: Knd,
id-graph: Graph(S),
Id: Id,
list: T List,
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
graph-rcvset: graph-rcvset(a;b;S;G;k),
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
iff: P ⇐⇒ Q,
id-graph: Graph(S),
prop: ℙ,
subtype_rel: A ⊆r B,
bfalse: ff
Latex:
\mforall{}[a:Id {}\mrightarrow{} Id {}\mrightarrow{} Id]. \mforall{}[b:Id]. \mforall{}[S:Id List]. \mforall{}[G:Graph(S)]. \mforall{}[k:Knd]. (graph-rcvset(a;b;S;G;k) \mmember{} \mBbbB{})
Date html generated:
2016_05_16-AM-10_58_52
Last ObjectModification:
2015_12_29-AM-09_10_03
Theory : event-ordering
Home
Index