Nuprl Lemma : pi-rank_wf
∀[p:pi_term()]. (pi-rank(p) ∈ ℕ)
Proof
Definitions occuring in Statement :
pi-rank: pi-rank(p),
pi_term: pi_term(),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
pi-rank: pi-rank(p),
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
ge: i ≥ j ,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
so_apply: x[s1;s2;s3],
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[p:pi\_term()]. (pi-rank(p) \mmember{} \mBbbN{})
Date html generated:
2016_05_17-AM-11_23_34
Last ObjectModification:
2016_01_18-AM-07_48_47
Theory : event-logic-applications
Home
Index