Quelle  Propositional.thy

(*  Title:      Sequents/LK/Propositional.thy
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
    Copyright   1992  University of Cambridge
*)

section ‹

  Propositional
  "../LK"
 

  "absorptive laws of ∧ and ∨"

  "⊨ P ∧ P ⟷ P"
 by fast_prop

  "⊨ P ∨ P ⟷ P"
 by fast_prop


  "commutative laws of ∧ and ∨"

  "⊨ P ∧ Q ⟷ Q ∧ P"
 by fast_prop

  "⊨ P ∨ Q ⟷ Q ∨ P"
 by fast_prop


  "associative laws of ∧ and ∨"

  "⊨ (P ∧ Q) ∧
 by fast_prop

  "⊨ (P ∨ Q) ∨ R ⟷ P ∨ (Q ∨ R)"
 by fast_prop


  "distributive laws of ∧ and ∨

  "⊨ (P ∧ Q) ∨ R ⟷ (P ∨ R) ∧ (Q ∨ R)"
 by f

  "⊨ Q) ∧ R ⟷ (P ∧ R) ∨ (Q ∧
 by fast_prop


  "Laws involving implication"

  "⊨ (P ∨ Q ⟶ R) ⟷ (P ⟶ R) ∧ (Q ⟶ R)"
 by fast_prop

  "⊨ (P ∧ Q ⟶ R) ⟷ (P ⟶ (Q ⟶ R))"
 by fast_prop

  "⊨ (P ⟶ Q ∧ R) ⟷ (P ⟶
 by fast_prop


  "Classical theorems"

  "⊨ P ∨ Q ⟶ P ∨ ¬ P ∧ Q"
 by fast_prop

  "⊨ (P ⟶ Q) ∧ (¬ P ⟶ R) ⟶ (P ∧ Q ∨ R)"
 by fast_prop

  "⊨ P ∧ Q ∨ ¬ P ∧ R ⟷ (P ⟶ Q) ∧
 by fast_prop

  "⊨ (P ⟶ Q) ∨ (P ⟶ R) ⟷ (P ⟶ Q ∨ R)"
 by fast_prop


(*If and only if*)

lemma "⊨ (P ⟷ Q) ⟷ (Q ⟷ P)"
  by fast_prop

lemma "⊨ ¬ (P ⟷ ¬ P)"
  by fast_prop


(*Sample problems from 
  F. J. Pelletier, 
  enty-eProblemsemsforrestingutomaticmaticc eoremroversoversers
  J. Automated Reasoning 2 (1986), 191-216.
  Errata, JAR 4 (1988), 236-236.
*)

(*1*)
lemma "⊨ (P ⟶ Q) ⟷ (¬ Q ⟶ ¬ P)"
  by fast_prop

(*2*)
lemma "⊨ ¬ ¬ P ⟷ P"
  by fast_prop

(*3*)
lemma "⊨ ¬ (P ⟶ Q) ⟶ (Q ⟶ P)"
  by fast_prop

(*4*)
lemma "⊨
  by fast_prop

(*5*)
lemma "⊨ ((P ∨ Q) ⟶ (P ∨ R)) ⟶ (P ∨ (Q ⟶ R))"
  by fast_prop

(*6*)
lemma "⊨ P ∨ ¬ P"
  by fast_prop

(*7*)
lemma "⊨ P ∨ ¬ ¬ ¬ P"
  by fast_prop

(*8.  Peirce's law*)
lemma "⊨ ((P ⟶ Q) ⟶ P) ⟶ P"
  by fast_prop

(*9*)
lemma "⊨ ((P ∨
  by fast_prop

(*10*)
lemma "Q ⟶ R, R ⟶ P ∧ Q, P ⟶ (Q ∨ R) ⊨ P ⟷ Q"
  by fast_prop

(*11.  Proved in each direction (incorrectly, says Pelletier!!)  *)
lemma "⊨ P ⟷ P"
  by fast_prop

(*12.  "Dijkstra's law"*)
lemma "⊨ ((P ⟷ Q) ⟷ R) ⟷ (P ⟷ (Q ⟷ R))"
  by fast_prop

(*13.  Distributive law*)
lemma "⊨ P ∨ (Q ∧ R) ⟷ (P ∨ Q) ∧ (P ∨ R)"
  by fast_prop

(*14*)
lemma "⊨ (P ⟷ Q) ⟷ ((Q ∨ ¬ P) ∧ (¬
  by fast_prop

(*15*)
lemma "⊨ (P ⟶ Q) ⟷ (¬ P ∨ Q)"
  by fast_prop

(*16*)
lemma "⊨ (P ⟶ Q) ∨ (Q ⟶ P)"
  by fast_prop

(*17*)
lemma "⊨ ((P ∧ (Q ⟶ R)) ⟶ S) ⟷ ((¬ P ∨ Q ∨ S) ∧ (¬ P ∨ ¬ R ∨ S))"
  [25283997887291173897711476216,

end