-- Maclain Hunter: Proof of (((P & Q) & R) & S) & T by Maclain Hunter
-- Exact authored source SHA-256: 22ee8268ac3d1e44976c7c3bd22dd77f9b680aad7b4d153150c09836e6791e18
-- Machine formalization by Replit Agent; authority below Logic/Logos/God.
import Lean
namespace HunterAuthored

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

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

end HunterAuthored