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

Theorem eusv2nf 4552
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 2089 . . . 4  |-  F/ y E! y E. x  y  =  A
2 nfe1 1544 . . . . . . 7  |-  F/ x E. x  y  =  A
32nfeu 2097 . . . . . 6  |-  F/ x E! y E. x  y  =  A
4 eusv2.1 . . . . . . . . 9  |-  A  e. 
_V
54isseti 2810 . . . . . . . 8  |-  E. y 
y  =  A
6 19.8a 1638 . . . . . . . . 9  |-  ( y  =  A  ->  E. x  y  =  A )
76ancri 324 . . . . . . . 8  |-  ( y  =  A  ->  ( E. x  y  =  A  /\  y  =  A ) )
85, 7eximii 1650 . . . . . . 7  |-  E. y
( E. x  y  =  A  /\  y  =  A )
9 eupick 2158 . . . . . . 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 1570 . . . . 5  |-  ( E! y E. x  y  =  A  ->  A. x
( E. x  y  =  A  ->  y  =  A ) )
12 nf3 1716 . . . . 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 1570 . . 3  |-  ( E! y E. x  y  =  A  ->  A. y F/ x  y  =  A )
15 dfnfc2 3910 . . . 4  |-  ( A. x  A  e.  _V  ->  ( F/_ x A  <->  A. y F/ x  y  =  A ) )
1615, 4mpg 1499 . . 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 4550 . . . 4  |-  ( E! y A. x  y  =  A  <->  ( F/_ x A  /\  A  e. 
_V ) )
194, 18mpbiran2 949 . . 3  |-  ( E! y A. x  y  =  A  <->  F/_ x A )
20 eusv2i 4551 . . 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 1395    = wceq 1397   F/wnf 1508   E.wex 1540   E!weu 2078    e. wcel 2201   F/_wnfc 2360   _Vcvv 2801
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2212
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-rex 2515  df-v 2803  df-sbc 3031  df-csb 3127  df-un 3203  df-sn 3674  df-pr 3675  df-uni 3893
This theorem is referenced by:  eusv2  4553
  Copyright terms: Public domain W3C validator