Chapter 1.

6, Problem 26E

Problem

Justify the rule of universal transitivity, which stales that if and

are true. then is true, where the domains of all quantifiers are
the same.

Step-by-step solution

Step 1 of 3

The rule of universal transitivity is stated as follows:

i.e, any x that makes P(x) true makes Q(x) true. …… (1)

Any x that makes Q(x) true makes R(x) true. …… (2)

∴ ∴ any x that makes P(x) true makes R(x) true.

Step 2 of 3
The rule can be justified as follows:

Step Justification

1. Hypothesis

2. Universal instantiation for arbitrary a

3. Hypothesis

4. Universal instantiation for arbitrary a

5. Hypothetical syllogism for 2, 4

6. Universal generalization

Step 3 of 3
Alternately assume the contradiction to justify the rule:

That is, holds.

Or, that does not hold. …… (3)

An implication is false whenever is true and is false.

…… (4)

Use the fact that is false in (2) to get is false.

Again, use that is false in (1) to get is false.

This is a contradiction to (4).

So, the supposition is wrong.

Therefore, holds.