Nuprl Lemma : pi_level_wf

[t:pi_term()]. (pi_level(t) ∈ ℕ)


Proof




Definitions occuring in Statement :  pi_level: pi_level(pi-term) 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_level: pi_level(pi-term) nat: le: A ≤ B and: P ∧ Q less_than': less_than'(a;b) false: False not: ¬A implies:  Q prop: so_lambda: so_lambda(x,y,z.t[x; y; z]) so_apply: x[s1;s2;s3] so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]) all: x:A. B[x] guard: {T} ge: i ≥  decidable: Dec(P) or: P ∨ Q uimplies: supposing a satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] top: Top so_apply: x[s1;s2;s3;s4] uiff: uiff(P;Q) so_lambda: λ2y.t[x; y] so_apply: x[s1;s2]

Latex:
\mforall{}[t:pi\_term()].  (pi\_level(t)  \mmember{}  \mBbbN{})



Date html generated: 2016_05_17-AM-11_25_41
Last ObjectModification: 2016_01_18-AM-07_47_49

Theory : event-logic-applications


Home Index