Skip to content
TheChatArchiveThe Chat Archive
o4-mini-2025-04-16· OpenAIHugging Face LMArena Human Preference 140K

Write me an informal proof: Given: A->B - (A B) -> B

From a Chatbot Arena battleThe same person sent this prompt to two anonymous models at once. Compare it with Googlegemma-3n-e4b-it’s answer.
  1. User

    Write me an informal proof:

    Given: A->B

    (A | B) -> B

  2. Assistant

    Here’s a quick, informal “proof by cases” of

    From A→B we get (A∨B)→B.  
    

    —
    Proof.

    1. Assume A→B.
    2. To show: (A∨B)→B.
    3. So suppose A∨B is true.
    4. Then there are two possibilities:
      • Case 1: A holds.
        • Since A→B, we get B.
      • Case 2: B holds.
        • Then B is true immediately.
    5. In either case, B is true.
    6. Hence, assuming A∨B we’ve derived B.
    7. Therefore (A∨B)→B, as required. 🏁
  3. User

    Reference the axiom used to support the proof step.

  4. 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):

    1. Premise
      1.1 A → B
    2. Goal: (A ∨ B) → B
    3. Assume A ∨ B (Assumption for →-intro)
    4. 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)
    5. 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.

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.