MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  raleqf Structured version   Unicode version

Theorem raleqf 3011
Description: Equality theorem for restricted universal quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
Hypotheses
Ref Expression
raleq1f.1  |-  F/_ x A
raleq1f.2  |-  F/_ x B
Assertion
Ref Expression
raleqf  |-  ( A  =  B  ->  ( A. x  e.  A  ph  <->  A. x  e.  B  ph ) )

Proof of Theorem raleqf
StepHypRef Expression
1 raleq1f.1 . . . 4  |-  F/_ x A
2 raleq1f.2 . . . 4  |-  F/_ x B
31, 2nfeq 2623 . . 3  |-  F/ x  A  =  B
4 eleq2 2524 . . . 4  |-  ( A  =  B  ->  (
x  e.  A  <->  x  e.  B ) )
54imbi1d 317 . . 3  |-  ( A  =  B  ->  (
( x  e.  A  ->  ph )  <->  ( x  e.  B  ->  ph )
) )
63, 5albid 1821 . 2  |-  ( A  =  B  ->  ( A. x ( x  e.  A  ->  ph )  <->  A. x
( x  e.  B  ->  ph ) ) )
7 df-ral 2800 . 2  |-  ( A. x  e.  A  ph  <->  A. x
( x  e.  A  ->  ph ) )
8 df-ral 2800 . 2  |-  ( A. x  e.  B  ph  <->  A. x
( x  e.  B  ->  ph ) )
96, 7, 83bitr4g 288 1  |-  ( A  =  B  ->  ( A. x  e.  A  ph  <->  A. x  e.  B  ph ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184   A.wal 1368    = wceq 1370    e. wcel 1758   F/_wnfc 2599   A.wral 2795
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-10 1777  ax-11 1782  ax-12 1794  ax-ext 2430
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1373  df-ex 1588  df-nf 1591  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ral 2800
This theorem is referenced by:  raleq  3015  raleqbid  3027  dfon2lem3  27734  indexa  28767  ralbi12f  29113  iineq12f  29117  ac6s6f  29125  stoweidlem28  29963  stoweidlem52  29987
  Copyright terms: Public domain W3C validator