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

Theorem eusv2nf 4471
Description: Two ways to express single-valuedness of a class expression  A ( x ). (Contributed by Mario Carneiro, 18-Nov-2016.)
Hypothesis
Ref Expression
eusv2.1  |-  A  e. 
_V
Assertion
Ref Expression
eusv2nf  |-  ( E! y E. x  y  =  A  <->  F/_ x A )
Distinct variable groups:    x, y    y, A
Allowed substitution hint:    A( x)

Proof of Theorem eusv2nf
StepHypRef Expression
1 nfeu1 2049 . . . 4  |-  F/ y E! y E. x  y  =  A
2 nfe1 1507 . . . . . . 7  |-  F/ x E. x  y  =  A
32nfeu 2057 . . . . . 6  |-  F/ x E! y E. x  y  =  A
4 eusv2.1 . . . . . . . . 9  |-  A  e. 
_V
54isseti 2760 . . . . . . . 8  |-  E. y 
y  =  A
6 19.8a 1601 . . . . . . . . 9  |-  ( y  =  A  ->  E. x  y  =  A )
76ancri 324 . . . . . . . 8  |-  ( y  =  A  ->  ( E. x  y  =  A  /\  y  =  A ) )
85, 7eximii 1613 . . . . . . 7  |-  E. y
( E. x  y  =  A  /\  y  =  A )
9 eupick 2117 . . . . . . 7  |-  ( ( E! y E. x  y  =  A  /\  E. y ( E. x  y  =  A  /\  y  =  A )
)  ->  ( E. x  y  =  A  ->  y  =  A ) )
108, 9mpan2 425 . . . . . 6  |-  ( E! y E. x  y  =  A  ->  ( E. x  y  =  A  ->  y  =  A ) )
113, 10alrimi 1533 . . . . 5  |-  ( E! y E. x  y  =  A  ->  A. x
( E. x  y  =  A  ->  y  =  A ) )
12 nf3 1680 . . . . 5  |-  ( F/ x  y  =  A  <->  A. x ( E. x  y  =  A  ->  y  =  A ) )
1311, 12sylibr 134 . . . 4  |-  ( E! y E. x  y  =  A  ->  F/ x  y  =  A
)
141, 13alrimi 1533 . . 3  |-  ( E! y E. x  y  =  A  ->  A. y F/ x  y  =  A )
15 dfnfc2 3842 . . . 4  |-  ( A. x  A  e.  _V  ->  ( F/_ x A  <->  A. y F/ x  y  =  A ) )
1615, 4mpg 1462 . . 3  |-  ( F/_ x A  <->  A. y F/ x  y  =  A )
1714, 16sylibr 134 . 2  |-  ( E! y E. x  y  =  A  ->  F/_ x A )
18 eusvnfb 4469 . . . 4  |-  ( E! y A. x  y  =  A  <->  ( F/_ x A  /\  A  e. 
_V ) )
194, 18mpbiran2 943 . . 3  |-  ( E! y A. x  y  =  A  <->  F/_ x A )
20 eusv2i 4470 . . 3  |-  ( E! y A. x  y  =  A  ->  E! y E. x  y  =  A )
2119, 20sylbir 135 . 2  |-  ( F/_ x A  ->  E! y E. x  y  =  A )
2217, 21impbii 126 1  |-  ( E! y E. x  y  =  A  <->  F/_ x A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1362    = wceq 1364   F/wnf 1471   E.wex 1503   E!weu 2038    e. wcel 2160   F/_wnfc 2319   _Vcvv 2752
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-rex 2474  df-v 2754  df-sbc 2978  df-csb 3073  df-un 3148  df-sn 3613  df-pr 3614  df-uni 3825
This theorem is referenced by:  eusv2  4472
  Copyright terms: Public domain W3C validator