Theorem 2ralbii 2516

Description: Inference adding two restricted universal quantifiers to both sides of an equivalence. (Contributed by NM, 1-Aug-2004.)

Hypothesis

Ref	Expression
ralbii.1	|- ( ph <-> ps )

Assertion

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

Proof of Theorem 2ralbii

Step	Hyp	Ref	Expression
1		ralbii.1	. . 3 |- ( ph <-> ps )
2	1	ralbii 2514	. 2 |- ( A. y e. B ph <-> A. y e. B ps )
3	2	ralbii 2514	1 |- ( A. x e. A A. y e. B ph <-> A. x e. A A. y e. B ps )

Syntax hints:   <-> wb 105   A.wral 2486

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 1471  ax-gen 1473  ax-4 1534  ax-17 1550

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-ral 2491

This theorem is referenced by:  rmo4f  2978  ordsoexmid  4628  cnvsom  5245  fununi  5361  tpossym  6385  axpre-suploc  8050  issubm  13419  isbasis2g  14632  ivthdich  15240