Create a proof from the following TFL sentence(s) A → C , B → D ⊢ (A ∧ B) → (C ∧ D)
- User
Create a proof from the following TFL sentence(s) A → C , B → D ⊢ (A ∧ B) → (C ∧ D)
Assistant
- A → C (Premise)
- B → D (Premise)
- A ∧ B (Assumption for →I)
- A (∧E from 3)
- B (∧E from 3)
- C (→E from 1 and 4)
- D (→E from 2 and 5)
- C ∧ D (∧I from 6 and 7)
- (A ∧ B) → (C ∧ D) (→I from 3-8)
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.