Use any types of rules and identities but which are correct and all are related to maths
Suppose there are n proofs that 1=2. From this we derive that there are n+1-1=n+2-1=n+1proofs that 1=2. Therefore, by induction, there are infinitely many proofs that 1=2.