Nuprl Lemma : pi-rank-pi-replace
∀[t,x:Name]. ∀[P:pi_term()]. (pi-rank(pi-replace(t;x;P)) = pi-rank(P) ∈ ℤ)
Proof
Definitions occuring in Statement :
pi-replace: pi-replace(t;x;P),
pi-rank: pi-rank(p),
pi_term: pi_term(),
name: Name,
uall: ∀[x:A]. B[x],
int: ℤ,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
nat: ℕ,
so_apply: x[s],
implies: P ⇒ Q,
pi-rank: pi-rank(p),
pi_term_ind: pi_term_ind(v;zero;pre,body,rec1....;left,right,rec2,rec3....;left,right,rec4,rec5....;body,rec6....;name,body,rec7....),
pi-replace: pi-replace(t;x;P),
pizero: pizero(),
all: ∀x:A. B[x],
picomm: picomm(pre;body),
prop: ℙ,
pioption: pioption(left;right),
pipar: pipar(left;right),
pirep: pirep(body),
pinew: pinew(name;body),
guard: {T},
let: let
Latex:
\mforall{}[t,x:Name]. \mforall{}[P:pi\_term()]. (pi-rank(pi-replace(t;x;P)) = pi-rank(P))
Date html generated:
2016_05_17-AM-11_24_39
Last ObjectModification:
2015_12_29-PM-06_54_02
Theory : event-logic-applications
Home
Index