Nuprl Lemma : lconnects_wf
∀[p:IdLnk List]. ∀[i,j:Id]. (lconnects(p;i;j) ∈ ℙ)
Proof
Definitions occuring in Statement :
lconnects: lconnects(p;i;j),
IdLnk: IdLnk,
Id: Id,
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
lconnects: lconnects(p;i;j),
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
and: P ∧ Q,
implies: P ⇒ Q,
uimplies: b supposing a,
all: ∀x:A. B[x],
or: P ∨ Q,
not: ¬A,
false: False,
cons: [a / b],
top: Top,
guard: {T},
nat: ℕ,
le: A ≤ B,
decidable: Dec(P),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
uiff: uiff(P;Q),
subtract: n - m,
subtype_rel: A ⊆r B,
less_than': less_than'(a;b),
true: True,
listp: A List+,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff
Latex:
\mforall{}[p:IdLnk List]. \mforall{}[i,j:Id]. (lconnects(p;i;j) \mmember{} \mBbbP{})
Date html generated:
2016_05_16-AM-10_56_54
Last ObjectModification:
2016_01_17-PM-03_47_44
Theory : event-ordering
Home
Index