Theorem ralcom4 1360

Description: Commutation of restricted and unrestricted universal quantifiers.

Assertion

Ref	Expression
ralcom4	|- (A.x e. A A.yph <-> A.yA.x e. A ph)

Distinct variable group(s):   x,y   y,A

Proof of Theorem ralcom4

Step	Hyp	Ref	Expression
1		ralcom 1312	. 2 |- (A.y e. V A.x e. A ph <-> A.x e. A A.y e. V ph)
2		ralv 1357	. 2 |- (A.y e. V A.x e. A ph <-> A.yA.x e. A ph)
3		ralv 1357	. . 3 |- (A.y e. V ph <-> A.yph)
4	3	biral 1223	. 2 |- (A.x e. A A.y e. V ph <-> A.x e. A A.yph)
5	1, 2, 4	3bitr3r 157	1 |- (A.x e. A A.yph <-> A.yA.x e. A ph)

Syntax hints:   <-> wb 127  A.wal 672  A.wral 1201  Vcvv 1348

This theorem is referenced by:  reluni 2493  kmlem11 3590

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-6 675  ax-7 676  ax-gen 677  ax-9 799  ax-12 802  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-v 1349

metamath.org