This lecture introduces informal proofs commonly used in mathematics, computer science, and other disciplines, highlighting their practical applications in verifying computer programs, ensuring system security, and enabling artificial intelligence. It covers the terminology, forms, and formulation of theorems, emphasizing the importance of proving theorems through direct and indirect methods like proof by contraposition and contradiction.