---

Step * 1 1 of Lemma rank-par-decompose


1. P : pi_term()
2. ↑pipar?(P)
3. P = pipar(pipar-left(P);pipar-right(P)) ∈ pi_term()
⊢ pi-rank(P) = ((pi-rank(pipar-left(P)) + pi-rank(pipar-right(P))) + 1) ∈ ℕ
BY
{ InstLemma `rank-par` [⌈pipar-left(P)⌉; ⌈pipar-right(P)⌉]⋅
THEN Auto }

---

Latex:

---

Latex:

1.  P  :  pi\_term()
2.  \muparrow{}pipar?(P)
3.  P  =  pipar(pipar-left(P);pipar-right(P))
\mvdash{}  pi-rank(P)  =  ((pi-rank(pipar-left(P))  +  pi-rank(pipar-right(P)))  +  1)


By

---

Latex:
InstLemma  `rank-par`  [\mkleeneopen{}pipar-left(P)\mkleeneclose{};  \mkleeneopen{}pipar-right(P)\mkleeneclose{}]\mcdot{}
THEN  Auto

---

Home Index