User:Prime.mover/Proof Structures

Ordinary proofs
and so on.

$(1)$ implies $(2)$
Let $...$ be a [definiend] by definition $1$.

Then by definition:
 * [Definition 1 of definiend]



Thus $...$ is a [definiend] by definition $2$.

$(2)$ implies $(1)$
Let $...$ be a [definiend] by definition $2$.

Then by definition:
 * [Definition 2 of definiend]



Thus $...$ is a [definiend] by definition $1$.

]

Integration by Parts
With a view to expressing the primitive in the form:
 * $\ds \int u \frac {\d v} {\d x} \rd x = u v - \int v \frac {\d u} {\d x} \rd x$

let:

and let:

Then:

Partition Proofs
Testing each of the criteria for a partition as follows:

Each element in no more than one component
Thus each element of ... is in no more than one component of ... .

Each element in at least one component
Thus each element of ... is in at least one component of ... .

No component is empty
Thus no component of ... is empty.

Thus ... is a partition by definition.

Metric Space proofs
It is to be demonstrated that $d$ satisfies all the metric space axioms.

Proof of
So holds for $d$.

Proof of
So holds for $d$.

Proof of
So holds for $d$.

Proof of
So holds for $d$.

Thus $d$ satisfies all the metric space axioms and so is a metric.

Topology Proofs
Each of the open set axioms is examined in turn:

Let $\family {U_i}_{i \mathop \in I}$ be an indexed family of open sets of $T$.

Let $\ds V = \bigcup_{i \mathop \in I} U_i$ be the union of $\family {U_i}_{i \mathop \in I}$.



Hence $V$ is open by definition.

Let $U$ and $V$ be open sets of $T$.



Hence $U \cap V$ is open by definition.



All the open set axioms are fulfilled, and the result follows.

Equivalence Proofs
Checking in turn each of the criteria for equivalence:

Reflexivity
Thus ... is seen to be reflexive.

Symmetry
Thus ... is seen to be symmetric.

Transitivity
Thus ... is seen to be transitive.

... has been shown to be reflexive, symmetric and transitive.

Hence by definition it is an equivalence relation.

Ordering Proofs
Checking in turn each of the criteria for an ordering:

Reflexivity
So ... has been shown to be reflexive.

Transitivity
So ... has been shown to be transitive.

Antisymmetry
So ... has been shown to be antisymmetric.

... has been shown to be reflexive, transitive and antisymmetric.

Hence by definition it is an ordering.

Strict Ordering Proofs
Checking in turn each of the criteria for a strict ordering:

Antireflexivity
So ... has been shown to be antireflexive.

Transitivity
So ... has been shown to be transitive.

Asymmetry
So ... has been shown to be asymmetric.

... has been shown to be antireflexive, transitive and asymmetric.

Hence by definition it is a strict ordering.

Semigroup Proofs
Taking the semigroup axioms in turn:

Thus $...$ and so $...$ is closed.

Thus $...$ is associative.

The semigroup axioms are thus seen to be fulfilled, and so $...$ is a semigroup.

Group Proofs
Taking the group axioms in turn:

Thus $...$ and so $...$ is closed.

Thus $...$ is associative.

Thus $...$ is the identity element of $...$.

We have that $...$ is the identity element of $...$.

Thus every element $...$ of $...$ has an inverse $...$.

All the group axioms are thus seen to be fulfilled, and so $...$ is a group.

Semilattice Proofs
Taking the semilattice axioms in turn:

Thus $...$ is closed.

Thus $...$ is associative.

Thus $...$ is commutative.

Thus $...$ is idempotent.

All the semilattice axioms are thus seen to be fulfilled, and so $...$ is a semilattice.

Group Action Proofs
The group action axioms are investigated in turn.

Let $g, h \in G$ and $s \in S$.

Thus:



demonstrating that holds.

Then:

demonstrating that holds.

The group action axioms are thus seen to be fulfilled, and so $*$ is a group action.

Ring Proofs
Taking the ring axioms in turn:

Tableau proofs
...etc.

by : $...$