Nuprl Lemma : lpath_wf
∀[p:IdLnk List]. (lpath(p) ∈ ℙ)
Proof
Definitions occuring in Statement :
lpath: lpath(p),
IdLnk: IdLnk,
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
lpath: lpath(p),
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
less_than: a < b,
squash: ↓T,
uiff: uiff(P;Q),
so_apply: x[s]
Latex:
\mforall{}[p:IdLnk List]. (lpath(p) \mmember{} \mBbbP{})
Date html generated:
2016_05_16-AM-10_56_43
Last ObjectModification:
2016_01_17-PM-03_48_21
Theory : event-ordering
Home
Index