First, your criteria for the proof’s solution. Deductive elimination commonly goes by the name “constructive dilemma.” Same concept, different name. Reductio ad absurdum is a different matter. That is (from what I can tell) an “indirect proof.” Both are indeed inferences, but the Reductio ad absurdum is a little more complex, because it requires nesting an argument inside another argument. But still, a good question.
But Boagie makes a good point. Bi-Conditionals could be considered a tautologies if we examine them a bit closer. But for all intensive purposes, I’m looking only at the logical rules to extrapolate a comparison. A tautology inference states that for any P, PvP or P&P can be inferred. And for a Bi-Conditional, it is true as long as both components have the same truth value. A lot like a tautology as Boagie points out. But you also have a good point in that we must look only at the equivalence factor in a bi-Conditional because we must adhere to inferences. So actually, both you and Boagie are right… and further with really good perspectives on the same problem.
But to get to your proof.
There are a few problems though. If you want to use a constructive dilemma for your argument, you run into a problem setting up your argument when you are required to provide a disjunction (either, or) of the two antecedents of your existing conditionals. The only conditionals you can use are derived from equivalence of the bi-conditional. So you would need to provide, in your given argument before the proof, C v J (basically, I am a Christian or I have Jesus as my Savior). But that does not sound right, even though it could theoretically be done in the proof. You would in a sense need to contradict your faith to further the argument that you are indeed a Christian…oddly enough. And this is where the reductio comes in. This is also a rule which needs you to contradict your belief in order to affirm it. (i.e. ~P, then P by Indirect proof). The use of these inferences are problematic… but not impossible. But still, we want to solve the proof.
This may be a simpler way to solve your proof.

Gotta love Modus Ponens! Hope this helps.