A more traditional argument might look something like Axiom 1: ((1=0 && 1!=0) -> Pope(Russell) Proposed axiom 2: (1=0 && 1!=0) 1&2 modus ponens: Pope(Russell)
Can you explain why Axiom 1 is an axiom? I don't understand this
Using the rules of inference from here[1], plus an assumed starting point for arithmetic, another deduction might be
1. Proposed axiom: (1==0)
2. Maybe some arithmetic axiom, humour me: !(1==0)
3. 2, negation elimination: (1==0) -> Pope(Russell)
4. 1, 3 modus ponens: Pope(Russell).
That "negation elimination" rule of inference looks kinda like what I did earlier I guess, but less questionable.
1: https://en.wikipedia.org/wiki/Propositional_calculus#Example...