Axiom ax-c9

Description: Axiom of Quantifier Introduction. One of the equality and substitution axioms of predicate calculus with equality. Informally, it says that whenever z is distinct from x and y , and x = y is true, then x = y quantified with z is also true. In other words, z is irrelevant to the truth of x = y . Axiom scheme C9' in Megill p. 448 (p. 16 of the preprint). It apparently does not otherwise appear in the literature but is easily proved from textbook predicate calculus by cases.

This axiom is obsolete and should no longer be used. It is proved above as Theorem axc9 . (Contributed by NM, 10-Jan-1993) (New usage is discouraged.)

	Ref	Expression
Assertion	ax-c9	|- ( -. A. z z = x -> ( -. A. z z = y -> ( x = y -> A. z x = y ) ) )

Detailed syntax breakdown

Step	Hyp	Ref	Expression
0		vz	|- z
1	0	cv	|- z
2		vx	|- x
3	2	cv	|- x
4	1 3	wceq	|- z = x
5	4 0	wal	|- A. z z = x
6	5	wn	|- -. A. z z = x
7		vy	|- y
8	7	cv	|- y
9	1 8	wceq	|- z = y
10	9 0	wal	|- A. z z = y
11	10	wn	|- -. A. z z = y
12	3 8	wceq	|- x = y
13	12 0	wal	|- A. z x = y
14	12 13	wi	|- ( x = y -> A. z x = y )
15	11 14	wi	|- ( -. A. z z = y -> ( x = y -> A. z x = y ) )
16	6 15	wi	|- ( -. A. z z = x -> ( -. A. z z = y -> ( x = y -> A. z x = y ) ) )