I am having a hard time proving A → ¬ (¬ A ∧ B) with the Lean theorem prover. I set it up like this: example : A → ¬ (¬ A ∧ B)
god
media-keys
qubole
xmlworker
hpet
shared
xmodem
testability
clsx
amazon-ses
pch
fdmemtable
cross-correlation
pjax
tensorflow-slim
object-position
typescript-eslint
mousetrap
packery
unqualified-name
change-data-capture
future
twilio-autopilot
integrator
flutter-showmodalbottomsheet
bitmap
undetected-chromedriver
pingouin
bartender
quick.db