2023-05-23 21:38:33 +00:00
|
|
|
|
import Mathlib.Logic.Basic
|
|
|
|
|
|
import Mathlib.Tactic.Tauto
|
|
|
|
|
|
|
|
|
|
|
|
/-! # Common.Logic.Basic
|
|
|
|
|
|
|
|
|
|
|
|
Additional theorems and definitions related to basic logic.
|
|
|
|
|
|
-/
|
|
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
|
The de Morgan law that distributes negation across a conjunction.
|
|
|
|
|
|
-/
|
2023-06-04 23:34:42 +00:00
|
|
|
|
theorem not_and_de_morgan : (¬(p ∧ q)) ↔ (¬p ∨ ¬q) := by
|
2023-05-23 21:38:33 +00:00
|
|
|
|
tauto
|
|
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
|
Renaming of `not_or` to indicate its relationship to de Morgan's laws.
|
|
|
|
|
|
-/
|
2023-06-04 23:34:42 +00:00
|
|
|
|
theorem not_or_de_morgan : ¬(p ∨ q) ↔ ¬p ∧ ¬q := not_or
|
|
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
|
Universal quantification across nested set memberships can be commuted in either
|
|
|
|
|
|
order.
|
|
|
|
|
|
-/
|
|
|
|
|
|
theorem forall_mem_comm {X : Set α} {Y : Set β} (p : α → β → Prop)
|
|
|
|
|
|
: (∀ u ∈ X, (∀ v, v ∈ Y → p u v)) = (∀ v ∈ Y, (∀ u, u ∈ X → p u v)) := by
|
|
|
|
|
|
refine propext ?_
|
|
|
|
|
|
apply Iff.intro
|
|
|
|
|
|
· intro h v hv u hu
|
|
|
|
|
|
exact h u hu v hv
|
|
|
|
|
|
· intro h u hu v hv
|
|
|
|
|
|
exact h v hv u hu
|
