Theorem biralda 1213

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

Hypotheses

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

Assertion

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

Proof of Theorem biralda

Step	Hyp	Ref	Expression
1		biralda.1	. . 3 |- (ph -> A.xph)
2		biralda.2	. . . . 5 |- ((ph /\ x e. A) -> (ps <-> ch))
3	2	exp 291	. . . 4 |- (ph -> (x e. A -> (ps <-> ch)))
4	3	pm5.74d 444	. . 3 |- (ph -> ((x e. A -> ps) <-> (x e. A -> ch)))
5	1, 4	biald 782	. 2 |- (ph -> (A.x(x e. A -> ps) <-> A.x(x e. A -> ch)))
6		df-ral 1205	. 2 |- (A.x e. A ps <-> A.x(x e. A -> ps))
7		df-ral 1205	. 2 |- (A.x e. A ch <-> A.x(x e. A -> ch))
8	5, 6, 7	3bitr4g 428	1 |- (ph -> (A.x e. A ps <-> A.x e. A ch))

Syntax hints:   -> wi 2   <-> wb 127   /\ wa 196  A.wal 672   e. wcel 1092  A.wral 1201

This theorem is referenced by:  biraldva 1215  birald 1217  bi2ralda 1232  r19.15 1292  iineq2 2007  mapxpen 3390  xpmapenlem5 3395

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-gen 677

This theorem depends on definitions:  df-bi 128  df-an 198  df-ral 1205

metamath.org