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

Theorem epelg 4487
Description: The epsilon relation and membership are the same. General version of epel 4489. (Contributed by Scott Fenton, 27-Mar-2011.) (Revised by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
epelg  |-  ( B  e.  V  ->  ( A  _E  B  <->  A  e.  B ) )

Proof of Theorem epelg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 4205 . . . 4  |-  ( A  _E  B  <->  <. A ,  B >.  e.  _E  )
2 elopab 4454 . . . . . 6  |-  ( <. A ,  B >.  e. 
{ <. x ,  y
>.  |  x  e.  y }  <->  E. x E. y
( <. A ,  B >.  =  <. x ,  y
>.  /\  x  e.  y ) )
3 vex 2951 . . . . . . . . . . 11  |-  x  e. 
_V
4 vex 2951 . . . . . . . . . . 11  |-  y  e. 
_V
53, 4pm3.2i 442 . . . . . . . . . 10  |-  ( x  e.  _V  /\  y  e.  _V )
6 opeqex 4439 . . . . . . . . . 10  |-  ( <. A ,  B >.  = 
<. x ,  y >.  ->  ( ( A  e. 
_V  /\  B  e.  _V )  <->  ( x  e. 
_V  /\  y  e.  _V ) ) )
75, 6mpbiri 225 . . . . . . . . 9  |-  ( <. A ,  B >.  = 
<. x ,  y >.  ->  ( A  e.  _V  /\  B  e.  _V )
)
87simpld 446 . . . . . . . 8  |-  ( <. A ,  B >.  = 
<. x ,  y >.  ->  A  e.  _V )
98adantr 452 . . . . . . 7  |-  ( (
<. A ,  B >.  = 
<. x ,  y >.  /\  x  e.  y
)  ->  A  e.  _V )
109exlimivv 1645 . . . . . 6  |-  ( E. x E. y (
<. A ,  B >.  = 
<. x ,  y >.  /\  x  e.  y
)  ->  A  e.  _V )
112, 10sylbi 188 . . . . 5  |-  ( <. A ,  B >.  e. 
{ <. x ,  y
>.  |  x  e.  y }  ->  A  e. 
_V )
12 df-eprel 4486 . . . . 5  |-  _E  =  { <. x ,  y
>.  |  x  e.  y }
1311, 12eleq2s 2527 . . . 4  |-  ( <. A ,  B >.  e.  _E  ->  A  e.  _V )
141, 13sylbi 188 . . 3  |-  ( A  _E  B  ->  A  e.  _V )
1514a1i 11 . 2  |-  ( B  e.  V  ->  ( A  _E  B  ->  A  e.  _V ) )
16 elex 2956 . . 3  |-  ( A  e.  B  ->  A  e.  _V )
1716a1i 11 . 2  |-  ( B  e.  V  ->  ( A  e.  B  ->  A  e.  _V ) )
18 eleq12 2497 . . . 4  |-  ( ( x  =  A  /\  y  =  B )  ->  ( x  e.  y  <-> 
A  e.  B ) )
1918, 12brabga 4461 . . 3  |-  ( ( A  e.  _V  /\  B  e.  V )  ->  ( A  _E  B  <->  A  e.  B ) )
2019expcom 425 . 2  |-  ( B  e.  V  ->  ( A  e.  _V  ->  ( A  _E  B  <->  A  e.  B ) ) )
2115, 17, 20pm5.21ndd 344 1  |-  ( B  e.  V  ->  ( A  _E  B  <->  A  e.  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359   E.wex 1550    = wceq 1652    e. wcel 1725   _Vcvv 2948   <.cop 3809   class class class wbr 4204   {copab 4257    _E cep 4484
This theorem is referenced by:  epelc  4488  efrirr  4555  efrn2lp  4556  epne3  4753  cnfcomlem  7648  fpwwe2lem6  8502  ltpiord  8756  orvcelval  24718  predep  25459
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-rab 2706  df-v 2950  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-eprel 4486
  Copyright terms: Public domain W3C validator