theorem uptoeqd (_G: wff) (_n1 _n2: nat): $ _G -> _n1 = _n2 $ > $ _G -> upto _n1 = upto _n2 $;
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hyp _nh | _G -> _n1 = _n2 |
|
| 2 | 1 | poweq2d | _G -> 2 ^ _n1 = 2 ^ _n2 |
| 3 | 2 | subeq1d | _G -> 2 ^ _n1 - 1 = 2 ^ _n2 - 1 |
| 4 | 3 | conv upto | _G -> upto _n1 = upto _n2 |