-- Maclain Hunter: Predicated Propositions by Maclain Hunter
-- Exact authored source SHA-256: 1fc220556e7ee9cb2acad47b8d76fed95f0130786811ccfc768e7637c5bdd0c1
-- Machine formalization by Replit Agent; authority below Logic/Logos/God.
import Lean
namespace HunterAuthored

theorem inference_2 (v0 v1 v2 v3 : Bool) :
    ((!(((v0 && ((!v0) || v1)) && (v1 == v2)) && ((!v2) || v3))) || ((v0 && v1) && (v2 && v3))) = true := by
  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide
#print axioms inference_2

theorem inference_3 (v0 v1 v2 v3 : Bool) :
    ((!(((v1 && ((!v1) || v2)) && (v2 == v3)) && ((!v3) || v0))) || ((v1 && v2) && (v3 && v0))) = true := by
  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide
#print axioms inference_3

theorem inference_4 (v0 v1 v2 v3 : Bool) :
    ((!(((v2 && ((!v2) || v3)) && (v3 == v0)) && ((!v0) || v1))) || ((v2 && v3) && (v0 && v1))) = true := by
  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide
#print axioms inference_4

theorem inference_5 (v0 v1 v2 v3 : Bool) :
    ((!(((v3 && ((!v3) || v0)) && (v0 == v1)) && ((!v1) || v2))) || ((v3 && v0) && (v1 && v2))) = true := by
  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide
#print axioms inference_5

theorem source_identity_rule (α : Type) (a : α) : a = a := rfl
#print axioms source_identity_rule

end HunterAuthored