Theorem birald 1217

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

Hypotheses

Ref	Expression
birald.1	|- (ph -> A.xph)
birald.2	|- (ph -> (ps <-> ch))

Assertion

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

Proof of Theorem birald

Step	Hyp	Ref	Expression
1		birald.1	. 2 |- (ph -> A.xph)
2		birald.2	. . 3 |- (ph -> (ps <-> ch))
3	2	adantr 306	. 2 |- ((ph /\ x e. A) -> (ps <-> ch))
4	1, 3	biralda 1213	1 |- (ph -> (A.x e. A ps <-> A.x e. A ch))

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

This theorem is referenced by:  biraldv 1219  biral 1223  zfrep6 2744  cplem2 3546  ac6lem 3575

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