Proof step
Ore-algebra identity of two definitions
All-n equality of two definitions
- Concludes
- shift_x_plus_one of Triangle read by rows: T(n,k) is the number of words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and …
- Premises
- none: a direct theorem check
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-e434336350f0ed59· JSON- Operation
- All-n equality of two definitions
{ "operation": "definition_equality" } - Claims
- Certificate
definition_equality, SHA-256351494ef242a73a203ff78dd5b777db2eeb2baa867e532422bf37989b4ee1c46, 28,075 bytes (4,998 compressed); downloadpolytool replayed the certificate when the step was written.