Nuprl Lemma : pi-rank-choices_wf
∀[compList:(pi_prefix() × pi_term()) List]. (pi-rank-choices(compList) ∈ ℕ)
Proof
Definitions occuring in Statement :
pi-rank-choices: pi-rank-choices(compList),
pi_term: pi_term(),
pi_prefix: pi_prefix(),
list: T List,
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
product: x:A × B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
pi-rank-choices: pi-rank-choices(compList),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
bfalse: ff,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
top: Top,
or: P ∨ Q,
cons: [a / b],
guard: {T},
decidable: Dec(P),
subtract: n - m,
subtype_rel: A ⊆r B,
true: True,
so_lambda: λ2x.t[x],
so_apply: x[s],
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
ge: i ≥ j
Latex:
\mforall{}[compList:(pi\_prefix() \mtimes{} pi\_term()) List]. (pi-rank-choices(compList) \mmember{} \mBbbN{})
Date html generated:
2016_05_17-AM-11_24_19
Last ObjectModification:
2016_01_18-AM-07_48_18
Theory : event-logic-applications
Home
Index