Theorem ddelimf 908

Description: Version of ddelim 1000 without any variable restrictions.

Hypotheses

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

Assertion

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

Proof of Theorem ddelimf

Step	Hyp	Ref	Expression
1		ddelimf.1	. . 3 |- (ph -> A.xph)
2	1	hbsb4 905	. 2 |- (-. A.x x = y -> ([y / z]ph -> A.x[y / z]ph))
3		ddelimf.2	. . 3 |- (ps -> A.zps)
4		ddelimf.3	. . 3 |- (z = y -> (ph <-> ps))
5	3, 4	sbie 904	. 2 |- ([y / z]ph <-> ps)
6	5	bial 695	. 2 |- (A.x[y / z]ph <-> A.xps)
7	2, 5, 6	3imtr3g 425	1 |- (-. A.x x = y -> (ps -> A.xps))

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

This theorem is referenced by:  ddelim 1000

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

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

metamath.org