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

Theorem eqer 6930
Description: Equivalence relation involving equality of dependent classes  A ( x ) and  B ( y ). (Contributed by NM, 17-Mar-2008.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
eqer.1  |-  ( x  =  y  ->  A  =  B )
eqer.2  |-  R  =  { <. x ,  y
>.  |  A  =  B }
Assertion
Ref Expression
eqer  |-  R  Er  _V
Distinct variable groups:    x, y    y, A    x, B
Allowed substitution hints:    A( x)    B( y)    R( x, y)

Proof of Theorem eqer
Dummy variables  w  z  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqer.2 . . . . 5  |-  R  =  { <. x ,  y
>.  |  A  =  B }
21relopabi 4992 . . . 4  |-  Rel  R
32a1i 11 . . 3  |-  (  T. 
->  Rel  R )
4 id 20 . . . . . 6  |-  ( [_ z  /  x ]_ A  =  [_ w  /  x ]_ A  ->  [_ z  /  x ]_ A  = 
[_ w  /  x ]_ A )
54eqcomd 2440 . . . . 5  |-  ( [_ z  /  x ]_ A  =  [_ w  /  x ]_ A  ->  [_ w  /  x ]_ A  = 
[_ z  /  x ]_ A )
6 eqer.1 . . . . . 6  |-  ( x  =  y  ->  A  =  B )
76, 1eqerlem 6929 . . . . 5  |-  ( z R w  <->  [_ z  /  x ]_ A  =  [_ w  /  x ]_ A
)
86, 1eqerlem 6929 . . . . 5  |-  ( w R z  <->  [_ w  /  x ]_ A  =  [_ z  /  x ]_ A
)
95, 7, 83imtr4i 258 . . . 4  |-  ( z R w  ->  w R z )
109adantl 453 . . 3  |-  ( (  T.  /\  z R w )  ->  w R z )
11 eqtr 2452 . . . . 5  |-  ( (
[_ z  /  x ]_ A  =  [_ w  /  x ]_ A  /\  [_ w  /  x ]_ A  =  [_ v  /  x ]_ A )  ->  [_ z  /  x ]_ A  =  [_ v  /  x ]_ A )
126, 1eqerlem 6929 . . . . . 6  |-  ( w R v  <->  [_ w  /  x ]_ A  =  [_ v  /  x ]_ A
)
137, 12anbi12i 679 . . . . 5  |-  ( ( z R w  /\  w R v )  <->  ( [_ z  /  x ]_ A  =  [_ w  /  x ]_ A  /\  [_ w  /  x ]_ A  = 
[_ v  /  x ]_ A ) )
146, 1eqerlem 6929 . . . . 5  |-  ( z R v  <->  [_ z  /  x ]_ A  =  [_ v  /  x ]_ A
)
1511, 13, 143imtr4i 258 . . . 4  |-  ( ( z R w  /\  w R v )  -> 
z R v )
1615adantl 453 . . 3  |-  ( (  T.  /\  ( z R w  /\  w R v ) )  ->  z R v )
17 vex 2951 . . . . 5  |-  z  e. 
_V
18 eqid 2435 . . . . . 6  |-  [_ z  /  x ]_ A  = 
[_ z  /  x ]_ A
196, 1eqerlem 6929 . . . . . 6  |-  ( z R z  <->  [_ z  /  x ]_ A  =  [_ z  /  x ]_ A
)
2018, 19mpbir 201 . . . . 5  |-  z R z
2117, 202th 231 . . . 4  |-  ( z  e.  _V  <->  z R
z )
2221a1i 11 . . 3  |-  (  T. 
->  ( z  e.  _V  <->  z R z ) )
233, 10, 16, 22iserd 6923 . 2  |-  (  T. 
->  R  Er  _V )
2423trud 1332 1  |-  R  Er  _V
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359    T. wtru 1325    = wceq 1652    e. wcel 1725   _Vcvv 2948   [_csb 3243   class class class wbr 4204   {copab 4257   Rel wrel 4875    Er wer 6894
This theorem is referenced by:  ider  6931  frgpuplem  15396  fneer  26359
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-sbc 3154  df-csb 3244  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-br 4205  df-opab 4259  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-er 6897
  Copyright terms: Public domain W3C validator