Theorem dvelim 1997

Description: This theorem can be used to eliminate a distinct variable restriction on x and z and replace it with the "distinctor" -. A. x x = y as an antecedent. ph normally has z free and can be read ph ( z ), and ps substitutes y for z and can be read ph ( y ). We don't require that x and y be distinct: if they aren't, the distinctor will become false (in multiple-element domains of discourse) and "protect" the consequent.

To obtain a closed-theorem form of this inference, prefix the hypotheses with A. x A. z, conjoin them, and apply dvelimdf 1996.

Other variants of this theorem are dvelimf 1995 (with no distinct variable restrictions) and dvelimALT 1990 (that avoids ax-10 1485). (Contributed by NM, 23-Nov-1994.)

Hypotheses

Ref	Expression
dvelim.1	|- ( ph -> A. x ph )
dvelim.2	|- ( z = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
dvelim	|- ( -. A. x x = y -> ( ps -> A. x ps ) )

Distinct variable group:   ps, z

Allowed substitution hints:   ph( x, y, z)   ps( x, y)

Proof of Theorem dvelim

Step	Hyp	Ref	Expression
1		dvelim.1	. 2 |- ( ph -> A. x ph )
2		ax-17 1506	. 2 |- ( ps -> A. z ps )
3		dvelim.2	. 2 |- ( z = y -> ( ph <-> ps ) )
4	1, 2, 3	dvelimf 1995	1 |- ( -. A. x x = y -> ( ps -> A. x ps ) )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 104   A.wal 1333

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515

This theorem depends on definitions:  df-bi 116  df-nf 1441  df-sb 1743

This theorem is referenced by: (None)