Theorem ralcom4 2878

Description: Commutation of restricted and unrestricted universal quantifiers. (Contributed by NM, 26-Mar-2004.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)

Assertion

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

Distinct variable groups:   x,y   y,A

Allowed substitution hints:   ph(x,y)   A(x)

Proof of Theorem ralcom4

Step	Hyp	Ref	Expression
1		ralcom 2772	. 2 |- (A.x e. A A.y e. _V ph <-> A.y e. _V A.x e. A ph)
2		ralv 2873	. . 3 |- (A.y e. _V ph <-> A.yph)
3	2	ralbii 2639	. 2 |- (A.x e. A A.y e. _V ph <-> A.x e. A A.yph)
4		ralv 2873	. 2 |- (A.y e. _V A.x e. A ph <-> A.yA.x e. A ph)
5	1, 3, 4	3bitr3i 266	1 |- (A.x e. A A.yph <-> A.yA.x e. A ph)

Syntax hints:   <-> wb 176  A.wal 1540  A.wral 2615  _Vcvv 2860

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620  df-v 2862

This theorem is referenced by:  uniiunlem  3354  iunss  4008  nnadjoinpw  4522  funimass4  5369  clos1induct  5881  dfnnc3  5886