Theorem ralbida 1657

Description: Formula-building rule for restricted universal quantifier (deduction rule).

Hypotheses

Ref	Expression
ralbida.1	|- (ph -> A.xph)
ralbida.2	|- ((ph /\ x e. A) -> (ps <-> ch))

Assertion

Ref	Expression
ralbida	|- (ph -> (A.x e. A ps <-> A.x e. A ch))

Proof of Theorem ralbida

Step	Hyp	Ref	Expression
1		ralbida.1	. . 3 |- (ph -> A.xph)
2		ralbida.2	. . . 4 |- ((ph /\ x e. A) -> (ps <-> ch))
3	2	pm5.74da 586	. . 3 |- (ph -> ((x e. A -> ps) <-> (x e. A -> ch)))
4	1, 3	albid 1104	. 2 |- (ph -> (A.x(x e. A -> ps) <-> A.x(x e. A -> ch)))
5		df-ral 1649	. 2 |- (A.x e. A ps <-> A.x(x e. A -> ps))
6		df-ral 1649	. 2 |- (A.x e. A ch <-> A.x(x e. A -> ch))
7	4, 5, 6	3bitr4g 555	1 |- (ph -> (A.x e. A ps <-> A.x e. A ch))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 954   e. wcel 958  A.wral 1645

This theorem is referenced by:  ralbidva 1659  ralbid 1661  2ralbida 1677  r19.15 1753  iineq2 2579  mapxpen 4495  xpmapenlem5 4500  clm0 7083  clm0nns 7085  climabs0 7113

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-4 973  ax-5o 975

This theorem depends on definitions:  df-bi 147  df-an 225  df-ral 1649

Copyright terms: Public domain