ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ralcom3 Unicode version

Theorem ralcom3 2601
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
StepHypRef Expression
1 pm2.04 82 . . 3  |-  ( ( x  e.  A  -> 
( x  e.  B  ->  ph ) )  -> 
( x  e.  B  ->  ( x  e.  A  ->  ph ) ) )
21ralimi2 2495 . 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 ) ) )
43ralimi2 2495 . 2  |-  ( A. x  e.  B  (
x  e.  A  ->  ph )  ->  A. x  e.  A  ( x  e.  B  ->  ph )
)
52, 4impbii 125 1  |-  ( A. x  e.  A  (
x  e.  B  ->  ph )  <->  A. x  e.  B  ( x  e.  A  ->  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    e. wcel 1481   A.wral 2417
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1424  ax-gen 1426
This theorem depends on definitions:  df-bi 116  df-ral 2422
This theorem is referenced by:  zfregfr  4495  tgss2  12285
  Copyright terms: Public domain W3C validator