I having heavy difficulties with this exercise beacuse it doesn't have any premise. I can't get the result I want (which is posted on the title of the question) straight to the top level
1. p Assumption 2. (p => q) => p Assumption 3. p Reiteration: 1 4. ((p => q) => p) => p Implication Introduction: 2, 3 5. p => ((p => q) => p) => p Implication Introduction: 1, 4
ps: I don't want the entire proof of the expression. I would appreciate hints. If it is really complicated, then I accept the entire proof so I can study further.
ps: I know you all want to help, but I have only these operations available: -assumption -reiteration -delete -negation introduction -negation elimination -and introduction -and elimination -or introduction -or elimination -implication introduction -implication elimination -biconditional introduction -biconditional elimination It was cool to know Peirce's law, however I didn't find a way to implement it through the resources above.