## Proving DeMorgan's Theorem?

For my logic homework, I'm supposed to construct two proofs to prove that DeMorgan's is redundant. I'm not given a theorem or anything to start with.

I'm only allowed to use Modus Ponens, Modus Tollens, Hypothetical Syllogism, Simplification, COnjunction, Dilemma, Disjunctive Syllogism, Addition, Double Negation, Duplication, Commutation, Contraposition, Association, Biconditional Exchange, Conditional Exchange, Distribution, Exportation, Indirect Proof, and Conditional Proof.

Those are the only ones that we've studied in my class and the only ones that (I've noticed at least) are in the textbook (Understanding Symbolic Logic by Virginia Klenk). I'm only allowed to use Klenk's system, too.

I THINK I have one of them already, but I'm not completely positive. It feels... not quite right, but not quite wrong to me either.
1. ~A&B prem.
2. | (AvB) Assp. for I.P.
3. | ~A Simp. 1
4. | ~B Simp. 1
5. | A 2, 4 Disjunctive Syllogism
6. | (~A&A) 3, 5 conjunction
7. ~(AvB) 2-6 I.P.

I've tried looking around at the other answers for this on this forum, but none of them work for what I'm allowed to do.
 PhysOrg.com science news on PhysOrg.com >> City-life changes blackbird personalities, study shows>> Origins of 'The Hoff' crab revealed (w/ Video)>> Older males make better fathers: Mature male beetles work harder, care less about female infidelity

 Tags demorgan, proof, sentential logic

 Similar discussions for: Proving DeMorgan's Theorem? Thread Forum Replies Calculus & Beyond Homework 1 Precalculus Mathematics Homework 2 Calculus & Beyond Homework 13 Set Theory, Logic, Probability, Statistics 2 Engineering, Comp Sci, & Technology Homework 5