Nuprl Lemma : pi-new-trans_wf
∀[x:Name]. ∀[P:pi_term()]. ∀[g:{Q:pi_term()| pi-rank(Q) < pi-rank(pinew(x;P))}
⟶ Id
⟶ Name
⟶ (Name List)
⟶ pi-process()].
(pi-new-trans(x;P;g) ∈ Id ⟶ Name ⟶ (Name List) ⟶ pi-process())
Proof
Definitions occuring in Statement :
pi-new-trans: pi-new-trans(x;P;g),
pi-process: pi-process(),
pi-rank: pi-rank(p),
pinew: pinew(name;body),
pi_term: pi_term(),
Id: Id,
name: Name,
list: T List,
less_than: a < b,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
pi-new-trans: pi-new-trans(x;P;g),
pi-process: pi-process(),
Process: Process(P.M[P]),
process: process(P.M[P];P.E[P]),
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
isect2: T1 ⋂ T2,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
subtype_rel: A ⊆r B,
nat: ℕ,
prop: ℙ,
let: let,
piM: piM(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
uiff: uiff(P;Q),
and: P ∧ Q,
type-monotone: Monotone(T.F[T]),
PiDataVal: PiDataVal(),
pMsg: pMsg(P.M[P]),
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
sq_stable: SqStable(P),
squash: ↓T
Latex:
\mforall{}[x:Name]. \mforall{}[P:pi\_term()]. \mforall{}[g:\{Q:pi\_term()| pi-rank(Q) < pi-rank(pinew(x;P))\}
{}\mrightarrow{} Id
{}\mrightarrow{} Name
{}\mrightarrow{} (Name List)
{}\mrightarrow{} pi-process()].
(pi-new-trans(x;P;g) \mmember{} Id {}\mrightarrow{} Name {}\mrightarrow{} (Name List) {}\mrightarrow{} pi-process())
Date html generated:
2016_05_17-AM-11_34_34
Last ObjectModification:
2016_01_18-AM-07_47_41
Theory : event-logic-applications
Home
Index