Nuprl Lemma : rank-par-decompose
∀[P:pi_term()]. pi-rank(P) = ((pi-rank(pipar-left(P)) + pi-rank(pipar-right(P))) + 1) ∈ ℕ supposing ↑pipar?(P)
Proof
Definitions occuring in Statement :
pi-rank: pi-rank(p),
pipar-right: pipar-right(v),
pipar-left: pipar-left(v),
pipar?: pipar?(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,
pipar?_wf,
pi_term_wf,
pi-par-decompose,
rank-par,
pipar-left_wf,
pipar-right_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(pipar-left(P)) + pi-rank(pipar-right(P))) + 1) supposing \muparrow{}pipar?(P)
Date html generated:
2015_07_23-AM-11_33_14
Last ObjectModification:
2015_02_04-PM-03_43_28
Home
Index