@PaxDaga 2 reasons: (1) The kind of truth tables for PL that you are thinking of are not rigorous, and any proper precise system based on truth tables would have similar flavour to a Fitch-style system; (2) People who cannot even use the deductive system I gave for PL cannot possibly understand FOL.
Yes you can do that, which would have a Fitch-style flavour as I said in (1), but such a system would suffer from exponentially-sized proofs for even simple tautologies unless you know how to use the original rules efficiently in the first place.
In other words, you can add more rules to the system, but they would merely function as a means of skipping steps. They wouldn't improve the system in any essential way.
Firstly, I require you to use brackets for expressions like "Neg B implies ( B implies A )", because there is no reason to omit brackets. Secondly, you do not even need "B or A", but yes you need contradiction.
Look, you do not know PL. Therefore I do not accept any claim about proving some PL tautology from you unless you prove it in the system I gave you. If you are unable to do so, then don't claim to have a proof.
Stop being lazy and actually check the rules. Label each of your statements with the rule that lets you deduce it. You will see that you are not allowed to do certain steps, so your proof is wrong.
@user2180 What?! Im just asking for help ,I said that because the previous statement implies neg(A or B) the statement for that is just conjunction since both the components are true? Should I reply here or on trash?
*Before that
@user21820 My reasoning is since we know Neg B and neg A implies neg(A or B) by elimination we can say neg(A or B)
@PaxDaga You refuse to follow instructions. I said that you are NOT allowed to use anything except the deductive rules in the system. You are NOT allowed to write a single statement that is not directly allowed by the system. You CANNOT claim "Neg B and neg A implies neg(A or B)" because you NEVER proved it.