Conjunction elimination

In propositional logic, conjunction elimination is a rule that helps us break down statements that have two parts joined by "and." This rule says that if a statement like "A and B" is true, then each part — A and B — is also true by itself. This makes it easier to work with longer proofs by letting us look at just one part at a time.

For example, if someone says, "It's raining and it's pouring," we can use conjunction elimination to say, "Therefore it's raining." This shows how we can take one part of a combined statement and use it alone.

The rule has two parts. One lets us take the first part of a combined statement, and the other lets us take the second part. Together, they mean that when we see a statement with "and" joining two ideas, we can use either idea by itself in our reasoning. This helps make arguments and proofs clearer and easier to understand.

Formal notation

In logic, if two things are both true together, then each one is true on its own. This is called conjunction elimination.

We can write this using special symbols:

(P ∧ Q) ⊢ P

and

(P ∧ Q) ⊢ Q

These symbols mean that if "P and Q" are true, then "P" is true, and "Q" is also true.

We can also write this as rules that always work:

(P ∧ Q) → P

and

(P ∧ Q) → Q

Here, P and Q are any statements we might make.