There exists a 1951 paper by C. A. Meredith which proves a completeness meta-theorem for the "C, 0, δ, p" system which has as it's sole axiom Cδδ0δp under uniform substitution for propositional variables, uniform substitution for functorial variables [see here] or this part from A. N. Prior's Formal Logic, and detachment. There exists another system of the same type which has as it's axioms:
1. CδC00δ1
2. Cδ0Cδ1δp
I've read through a proof by Lukasiewicz which shows that from those two axioms follows:
3. CδC10δ0
4. CδC01δ1
5. CδC11δ1
6. 1
I know how to prove formulas like CδCpqCδpδq and CCpqCCqpCδpδq from the above 6 theses. And I can tell that if I can prove Cδδ0δ0 and Cδδ0δ1, I can prove Cδδ0δp. But, from the above 6 formulas, how can we prove something which has two δ's on one side and one δ on the other? How can we prove Cδδ0δ0 and Cδδ0δ1? Or can we prove Cδδ0δp without proving those two first?
I don't know why I wrote the above axioms when I didn't really care if they had the form CδCxyδz or CδzδCxy, but I suppose the forms I used might provide for a more instructive proof. Section 2. part I. of Meredith's paper gave me enough hints, along with some previous experience working with this sort of system, to construct a proof. As a special case of a more general metalogical statement in his paper indicates, if we prove CCCp0δ0CCpδC00δp, CCδ00Cδ0δp, and Cδ0CδC00δp we can prove Cδδ0δp in short order. Proving Cδ0CδC00δp can get proved from Cδ1δC00 and Cδ0Cδ1δp. CCδ00Cδ0δp consists of an instance of CCp0Cpq. How to prove CCCp0δ0CCpδC00δp can get seen from the cases CCC00δ0CC0δC00δ0 which reduces to CC1δ0CC0δC00δ0 which reduces to Cδ0CC0δC00δ0 an instance of CpCqp, and CCC10δ0CC1δC00δ1 which reduces to CCC10δ0CδC00δ1 which reduces to CCC10δ0Cδ1δ1 an instance of CpCqq. CδpδC1p will make for a useful lemma also.
First, we'll transform the axioms from having form CδCxyδz to form CδzδCxy. A useful, but strictly unnecessary (study steps 9 through 13 closely), lemma is Cpp.
Now, using 15 repeatedly as follows we'll transform 2. through 5.:
Now, we'll prove Cδ0CδC00δp.
Next up CpCqp.
To avoid re-numeraling, we'll prove CCδ00Cδ0δ0.
Now CCp0Cpq.
Now CδpδC1p
Now CCC00δ0CC0δC00δ0. Let $\alpha$ stand for a functorial variable of one argument.
Now CCC10δ0CC1δC00δ1.
Now CCCp0δ0CCpδC00δp
Now Cδδ0δp.