Step * of Lemma rank-rep-decompose

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

1
1. P : pi_term()
2. ↑pirep?(P)
⊢ pi-rank(P) = (pi-rank(pirep-body(P)) + 1) ∈ ℕ


Latex:


Latex:
\mforall{}[P:pi\_term()].  pi-rank(P)  =  (pi-rank(pirep-body(P))  +  1)  supposing  \muparrow{}pirep?(P)


By


Latex:
Auto




Home Index