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

Theorem eusvobj2 6337
Description: Specify the same property in two ways when class  B ( y ) is single-valued. (Contributed by NM, 1-Nov-2010.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)
Hypothesis
Ref Expression
eusvobj1.1  |-  B  e. 
_V
Assertion
Ref Expression
eusvobj2  |-  ( E! x E. y  e.  A  x  =  B  ->  ( E. y  e.  A  x  =  B 
<-> 
A. y  e.  A  x  =  B )
)
Distinct variable groups:    x, y, A    x, B
Allowed substitution hint:    B( y)

Proof of Theorem eusvobj2
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 euabsn2 3698 . . 3  |-  ( E! x E. y  e.  A  x  =  B  <->  E. z { x  |  E. y  e.  A  x  =  B }  =  { z } )
2 eleq2 2344 . . . . . 6  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  (
x  e.  { x  |  E. y  e.  A  x  =  B }  <->  x  e.  { z } ) )
3 abid 2271 . . . . . 6  |-  ( x  e.  { x  |  E. y  e.  A  x  =  B }  <->  E. y  e.  A  x  =  B )
4 elsn 3655 . . . . . 6  |-  ( x  e.  { z }  <-> 
x  =  z )
52, 3, 43bitr3g 278 . . . . 5  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  ( E. y  e.  A  x  =  B  <->  x  =  z ) )
6 nfre1 2599 . . . . . . . . 9  |-  F/ y E. y  e.  A  x  =  B
76nfab 2423 . . . . . . . 8  |-  F/_ y { x  |  E. y  e.  A  x  =  B }
87nfeq1 2428 . . . . . . 7  |-  F/ y { x  |  E. y  e.  A  x  =  B }  =  {
z }
9 eusvobj1.1 . . . . . . . . 9  |-  B  e. 
_V
109elabrex 5765 . . . . . . . 8  |-  ( y  e.  A  ->  B  e.  { x  |  E. y  e.  A  x  =  B } )
11 eleq2 2344 . . . . . . . . 9  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  ( B  e.  { x  |  E. y  e.  A  x  =  B }  <->  B  e.  { z } ) )
129elsnc 3663 . . . . . . . . . 10  |-  ( B  e.  { z }  <-> 
B  =  z )
13 eqcom 2285 . . . . . . . . . 10  |-  ( B  =  z  <->  z  =  B )
1412, 13bitri 240 . . . . . . . . 9  |-  ( B  e.  { z }  <-> 
z  =  B )
1511, 14syl6bb 252 . . . . . . . 8  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  ( B  e.  { x  |  E. y  e.  A  x  =  B }  <->  z  =  B ) )
1610, 15syl5ib 210 . . . . . . 7  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  (
y  e.  A  -> 
z  =  B ) )
178, 16ralrimi 2624 . . . . . 6  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  A. y  e.  A  z  =  B )
18 eqeq1 2289 . . . . . . 7  |-  ( x  =  z  ->  (
x  =  B  <->  z  =  B ) )
1918ralbidv 2563 . . . . . 6  |-  ( x  =  z  ->  ( A. y  e.  A  x  =  B  <->  A. y  e.  A  z  =  B ) )
2017, 19syl5ibrcom 213 . . . . 5  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  (
x  =  z  ->  A. y  e.  A  x  =  B )
)
215, 20sylbid 206 . . . 4  |-  ( { x  |  E. y  e.  A  x  =  B }  =  {
z }  ->  ( E. y  e.  A  x  =  B  ->  A. y  e.  A  x  =  B ) )
2221exlimiv 1666 . . 3  |-  ( E. z { x  |  E. y  e.  A  x  =  B }  =  { z }  ->  ( E. y  e.  A  x  =  B  ->  A. y  e.  A  x  =  B ) )
231, 22sylbi 187 . 2  |-  ( E! x E. y  e.  A  x  =  B  ->  ( E. y  e.  A  x  =  B  ->  A. y  e.  A  x  =  B )
)
24 euex 2166 . . 3  |-  ( E! x E. y  e.  A  x  =  B  ->  E. x E. y  e.  A  x  =  B )
25 rexn0 3556 . . . 4  |-  ( E. y  e.  A  x  =  B  ->  A  =/=  (/) )
2625exlimiv 1666 . . 3  |-  ( E. x E. y  e.  A  x  =  B  ->  A  =/=  (/) )
27 r19.2z 3543 . . . 4  |-  ( ( A  =/=  (/)  /\  A. y  e.  A  x  =  B )  ->  E. y  e.  A  x  =  B )
2827ex 423 . . 3  |-  ( A  =/=  (/)  ->  ( A. y  e.  A  x  =  B  ->  E. y  e.  A  x  =  B ) )
2924, 26, 283syl 18 . 2  |-  ( E! x E. y  e.  A  x  =  B  ->  ( A. y  e.  A  x  =  B  ->  E. y  e.  A  x  =  B )
)
3023, 29impbid 183 1  |-  ( E! x E. y  e.  A  x  =  B  ->  ( E. y  e.  A  x  =  B 
<-> 
A. y  e.  A  x  =  B )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   E.wex 1528    = wceq 1623    e. wcel 1684   E!weu 2143   {cab 2269    =/= wne 2446   A.wral 2543   E.wrex 2544   _Vcvv 2788   (/)c0 3455   {csn 3640
This theorem is referenced by:  eusvobj1  6338
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-nul 3456  df-sn 3646
  Copyright terms: Public domain W3C validator