Theorem cla4gf 1857

Description: Rule of specialization with implicit substitution. Compare Theorem 7.3 of [Quine] p. 44.

Hypotheses

Ref	Expression
cla4gf.1	|- (y e. A -> A.x y e. A)
cla4gf.2	|- (ps -> A.xps)
cla4gf.3	|- (x = A -> (ph <-> ps))

Assertion

Ref	Expression
cla4gf	|- (A e. B -> (A.xph -> ps))

Distinct variable groups:   x,y   y,A

Proof of Theorem cla4gf

Step	Hyp	Ref	Expression
1		elisset 1814	. 2 |- (A e. B -> A e. V)
2		isset 1811	. . . . 5 |- (A e. V <-> E.y y = A)
3		cla4gf.1	. . . . . . 7 |- (y e. A -> A.x y e. A)
4	3	hbeleq 1565	. . . . . 6 |- (y = A -> A.x y = A)
5		ax-17 970	. . . . . 6 |- (x = A -> A.y x = A)
6		eqeq1 1479	. . . . . 6 |- (y = x -> (y = A <-> x = A))
7	4, 5, 6	cbvex 1165	. . . . 5 |- (E.y y = A <-> E.x x = A)
8	2, 7	bitr 173	. . . 4 |- (A e. V <-> E.x x = A)
9		cla4gf.3	. . . . . 6 |- (x = A -> (ph <-> ps))
10	9	biimpd 153	. . . . 5 |- (x = A -> (ph -> ps))
11	10	19.22i 1039	. . . 4 |- (E.x x = A -> E.x(ph -> ps))
12	8, 11	sylbi 199	. . 3 |- (A e. V -> E.x(ph -> ps))
13		cla4gf.2	. . . 4 |- (ps -> A.xps)
14	13	19.36 1077	. . 3 |- (E.x(ph -> ps) <-> (A.xph -> ps))
15	12, 14	sylib 198	. 2 |- (A e. V -> (A.xph -> ps))
16	1, 15	syl 10	1 |- (A e. B -> (A.xph -> ps))

Syntax hints:   -> wi 3   <-> wb 146  A.wal 953   = wceq 955   e. wcel 957  E.wex 979  Vcvv 1808

This theorem is referenced by:  cla4egf 1858  cla4gv 1859  rcla4 1868  moi 1922

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-12 967  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-ext 1458

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 980  df-sb 1171  df-clab 1463  df-cleq 1468  df-clel 1471  df-v 1809

Copyright terms: Public domain