Nuprl Lemma : rank-new-decompose
∀[P:pi_term()]. pi-rank(P) = (pi-rank(pinew-body(P)) + 1) ∈ ℕ supposing ↑pinew?(P)
Proof
Definitions occuring in Statement :
pi-rank: pi-rank(p),
pinew-body: pinew-body(v),
pinew?: pinew?(v),
pi_term: pi_term(),
nat: ℕ,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
add: n + m,
natural_number: $n,
equal: s = t ∈ T
Lemmas :
assert_wf,
pinew?_wf,
pi_term_wf,
pi-new-decompose,
rank-new,
pinew-name_wf,
pinew-body_wf,
zero-le-nat,
pi-rank_wf,
squash_wf,
true_wf,
nat_wf,
iff_weakening_equal,
le_wf
Latex:
\mforall{}[P:pi\_term()]. pi-rank(P) = (pi-rank(pinew-body(P)) + 1) supposing \muparrow{}pinew?(P)
Date html generated:
2015_07_23-AM-11_33_19
Last ObjectModification:
2015_02_04-PM-03_43_16
Home
Index