(¬ A ∧ ¬ B) → ¬ (A ∨ B) prove of this example on lean language.
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
(¬ A ∧ ¬ B) → ¬ (A ∨ B) prove of this example on lean language.
(¬ A ∧ ¬ B) → ¬ (A ∨ B) prove of this example on lean language.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!