Theorem ddelim 1000

Description: This theorem can be used to eliminate a distinct variable restriction on x and z and replace it with the "distinctor" -. A.xx = y as an antecedent. ph is considered to contain z, and ps to have z replaced with y, and we don't require that x and y be distinct (if they aren't, the distinctor will become false and "protect" the consequent).

Hypotheses

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

Assertion

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

Distinct variable group(s):   ps,z

Proof of Theorem ddelim

Step	Hyp	Ref	Expression
1		ddelim.1	. 2 |- (ph -> A.xph)
2		ax-17 925	. 2 |- (ps -> A.zps)
3		ddelim.2	. 2 |- (z = y -> (ph <-> ps))
4	1, 2, 3	ddelimf 908	1 |- (-. A.x x = y -> (ps -> A.xps))

Syntax hints:  -. wn 1   -> wi 2   <-> wb 127  A.wal 672   = weq 797

This theorem is referenced by:  ddeeq1 1001  ddeeq2 1002  ddeel1 1003  ddeel2 1004  ax15 1006  rgen2 1248  ralcom2 1314

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-17 925

This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853

metamath.org