Theorem ralcom3 2535

Description: A commutative law for restricted quantifiers that swaps the domain of the restriction. (Contributed by NM, 22-Feb-2004.)

Assertion

Ref	Expression
ralcom3	|- ( A. x e. A ( x e. B -> ph ) <-> A. x e. B ( x e. A -> ph ) )

Proof of Theorem ralcom3

Step	Hyp	Ref	Expression
1		pm2.04 82	. . 3 |- ( ( x e. A -> ( x e. B -> ph ) ) -> ( x e. B -> ( x e. A -> ph ) ) )
2	1	ralimi2 2436	. 2 |- ( A. x e. A ( x e. B -> ph ) -> A. x e. B ( x e. A -> ph ) )
3		pm2.04 82	. . 3 |- ( ( x e. B -> ( x e. A -> ph ) ) -> ( x e. A -> ( x e. B -> ph ) ) )
4	3	ralimi2 2436	. 2 |- ( A. x e. B ( x e. A -> ph ) -> A. x e. A ( x e. B -> ph ) )
5	2, 4	impbii 125	1 |- ( A. x e. A ( x e. B -> ph ) <-> A. x e. B ( x e. A -> ph ) )

Syntax hints:   -> wi 4   <-> wb 104   e. wcel 1439   A.wral 2360

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1382  ax-gen 1384

This theorem depends on definitions:  df-bi 116  df-ral 2365

This theorem is referenced by:  zfregfr  4402  tgss2  11840