o4-mini-2025-04-16· OpenAI
LMArena Human Preference 140K
Write me an informal proof: Given: A->B - (A B) -> B
- User
Write me an informal proof:
Given: A->B
(A | B) -> B
- Assistant
Here’s a quick, informal “proof by cases” of
From A→B we get (A∨B)→B.—
Proof.- Assume A→B.
- To show: (A∨B)→B.
- So suppose A∨B is true.
- Then there are two possibilities:
- Case 1: A holds.
• Since A→B, we get B. - Case 2: B holds.
• Then B is true immediately.
- Case 1: A holds.
- In either case, B is true.
- Hence, assuming A∨B we’ve derived B.
- Therefore (A∨B)→B, as required. 🏁
- User
Reference the axiom used to support the proof step.
- Assistant
Here’s the same “proof by cases,” but now pointing out the exact inference‐axioms (or rules) we invoke at each step.
Proof (natural‐deduction style):
- Premise
1.1 A → B - Goal: (A ∨ B) → B
- Assume A ∨ B (Assumption for →-intro)
- Case-analysis on A ∨ B (∨-Elim)
4.1 Assume A (Assumption for ∨-Elim)
4.2 From A → B (1.1) and A (4.1) infer B (Modus Ponens)
4.3 Assume B (Assumption for ∨-Elim)
4.4 From B (4.3) infer B (Identity)
4.5 Hence B by ∨-Elim on (3), (4.1–4.2) & (4.3–4.4) - Discharge the assumption A ∨ B and conclude
(A ∨ B) → B (→-Intro from 3–4.5)
Axiom/rule references:
- Modus Ponens (MP): from P and (P → Q) infer Q.
- ∨-Elimination (∨-Elim): from P∨Q, [P⇒R], [Q⇒R] infer R.
- →-Introduction (→-Intro): from assuming P and deriving Q infer P→Q.
- Identity (or “B⇒B”): the tautology that any proposition follows from itself.
- Premise
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.