---

Step * of Lemma rank-par-decompose

∀[P:pi_term()]. pi-rank(P) = ((pi-rank(pipar-left(P)) + pi-rank(pipar-right(P))) + 1) ∈ ℕ supposing ↑pipar?(P)
BY
{ Auto }

1
1. P : pi_term()
2. ↑pipar?(P)
⊢ pi-rank(P) = ((pi-rank(pipar-left(P)) + pi-rank(pipar-right(P))) + 1) ∈ ℕ

---

Latex:

---

Latex:
\mforall{}[P:pi\_term()]
    pi-rank(P)  =  ((pi-rank(pipar-left(P))  +  pi-rank(pipar-right(P)))  +  1)  supposing  \muparrow{}pipar?(P)


By

---

Latex:
Auto

---

Home Index