Page 1 of 1

(A → (B → C)) → ((B ∧ ¬ C) → ¬ A) prove of this example on lean language.

Posted: Sat May 14, 2022 7:40 pm
by answerhappygod
(A → (B → C)) → ((B ∧ ¬ C) → ¬ A) prove of this example on lean language.