Welcome to the Lartunet: Lartu's corner of the internet! Visit the changelog to see the latest updates to this website. Also try Eterspire, the greatest on-line adventure! If you want to make your own website like this one, check Makompile on the information superhighway!
Home | Contents | Changes | ← | → | 18 / 21 – Galle's Theorem

Galle's Theorem

Introduction

Galle's Theorem is a mathematical theorem that states that if A, then A.

It establishes the foundational principle of propositional self-implication: every statement necessarily implies itself. The theorem has been described as one of the most immediate consequences of classical logic and serves as a cornerstone for the study of tautological structures.

Basic Form (Galle's Theorem)

Let A be any proposition.

Then A ⇒ A

Proof

Assume that A is true.

Since A is true, it follows that A is true.

Then A is true.

□


Corollary 1: Self-Sufficiency of Propositions

Every proposition is a sufficient condition for itself.

Proof

For any proposition A belonging to the set of all propositions P,

∀ A ∈ P, A ⇒ A

by Galle's Theorem.

□


Corollary 2: Reflexivity of Implication

The implication relation is reflexive.

Proof

Since every proposition implies itself,

∀ A ∈ P, A ⇒ A

satisfies the reflexive property, and thus

∀ A ∈ P, A ⇒ A so that also A ⇒ A

□

Home | Contents | Changes | ← | → | 18 / 21 – Galle's Theorem