Theorem 2ralbidva 2528

Description: Formula-building rule for restricted universal quantifiers (deduction form). (Contributed by NM, 4-Mar-1997.)

Hypothesis

Ref	Expression
2ralbidva.1	|- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps <-> ch ) )

Assertion

Ref	Expression
2ralbidva	|- ( ph -> ( A. x e. A A. y e. B ps <-> A. x e. A A. y e. B ch ) )

Distinct variable groups:   x, y, ph   y, A

Allowed substitution hints:   ps( x, y)   ch( x, y)   A( x)   B( x, y)

Proof of Theorem 2ralbidva

Step	Hyp	Ref	Expression
1		nfv 1551	. 2 |- F/ x ph
2		nfv 1551	. 2 |- F/ y ph
3		2ralbidva.1	. 2 |- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps <-> ch ) )
4	1, 2, 3	2ralbida 2527	1 |- ( ph -> ( A. x e. A A. y e. B ps <-> A. x e. A A. y e. B ch ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2176   A.wral 2484

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1470  ax-gen 1472  ax-4 1533  ax-17 1549

This theorem depends on definitions:  df-bi 117  df-nf 1484  df-ral 2489

This theorem is referenced by:  soinxp  4746  isotr  5887  fnmpoovd  6303  sgrppropd  13278  mndpropd  13305  mhmpropd  13331  cmnpropd  13664  rngpropd  13750  ringpropd  13833  lmodprop2d  14143  lsspropdg  14226  ismet2  14859  txmetcn  15024