Conditional Introduction

If we can show that \(Q\) follows from \(P\) (typically via a sub-proof) than we can assert that P implies Q. This is also sometimes known as Conditional Proof

Backlinks

Strategies for constructing proofs in propositional logic
- First, we consider what is the easiest possible way of achieving the proposition \((L \lor A) \land D\). Clearly it is to separately derive each disjunct (\(L \lor A\) and \(D\)) and then combine them with Conjunction Introduction. This provides us with our first goal: to derive each of the separate conjuncts.
Formal proofs in propositional logic
- Conditional Introduction

logicpropositional-logic