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

Theorem dfnfc2 3598
Description: An alternative statement of the effective freeness of a class  A, when it is a set. (Contributed by Mario Carneiro, 14-Oct-2016.)
Assertion
Ref Expression
dfnfc2  |-  ( A. x  A  e.  V  ->  ( F/_ x A  <->  A. y F/ x  y  =  A ) )
Distinct variable groups:    x, y    y, A
Allowed substitution hints:    A( x)    V( x, y)

Proof of Theorem dfnfc2
StepHypRef Expression
1 nfcvd 2179 . . . 4  |-  ( F/_ x A  ->  F/_ x
y )
2 id 19 . . . 4  |-  ( F/_ x A  ->  F/_ x A )
31, 2nfeqd 2192 . . 3  |-  ( F/_ x A  ->  F/ x  y  =  A )
43alrimiv 1754 . 2  |-  ( F/_ x A  ->  A. y F/ x  y  =  A )
5 simpr 103 . . . . . 6  |-  ( ( A. x  A  e.  V  /\  A. y F/ x  y  =  A )  ->  A. y F/ x  y  =  A )
6 df-nfc 2167 . . . . . . 7  |-  ( F/_ x { A }  <->  A. y F/ x  y  e.  { A } )
7 velsn 3392 . . . . . . . . 9  |-  ( y  e.  { A }  <->  y  =  A )
87nfbii 1362 . . . . . . . 8  |-  ( F/ x  y  e.  { A }  <->  F/ x  y  =  A )
98albii 1359 . . . . . . 7  |-  ( A. y F/ x  y  e. 
{ A }  <->  A. y F/ x  y  =  A )
106, 9bitri 173 . . . . . 6  |-  ( F/_ x { A }  <->  A. y F/ x  y  =  A )
115, 10sylibr 137 . . . . 5  |-  ( ( A. x  A  e.  V  /\  A. y F/ x  y  =  A )  ->  F/_ x { A } )
1211nfunid 3587 . . . 4  |-  ( ( A. x  A  e.  V  /\  A. y F/ x  y  =  A )  ->  F/_ x U. { A } )
13 nfa1 1434 . . . . . 6  |-  F/ x A. x  A  e.  V
14 nfnf1 1436 . . . . . . 7  |-  F/ x F/ x  y  =  A
1514nfal 1468 . . . . . 6  |-  F/ x A. y F/ x  y  =  A
1613, 15nfan 1457 . . . . 5  |-  F/ x
( A. x  A  e.  V  /\  A. y F/ x  y  =  A )
17 unisng 3597 . . . . . . 7  |-  ( A  e.  V  ->  U. { A }  =  A
)
1817sps 1430 . . . . . 6  |-  ( A. x  A  e.  V  ->  U. { A }  =  A )
1918adantr 261 . . . . 5  |-  ( ( A. x  A  e.  V  /\  A. y F/ x  y  =  A )  ->  U. { A }  =  A
)
2016, 19nfceqdf 2177 . . . 4  |-  ( ( A. x  A  e.  V  /\  A. y F/ x  y  =  A )  ->  ( F/_ x U. { A } 
<-> 
F/_ x A ) )
2112, 20mpbid 135 . . 3  |-  ( ( A. x  A  e.  V  /\  A. y F/ x  y  =  A )  ->  F/_ x A )
2221ex 108 . 2  |-  ( A. x  A  e.  V  ->  ( A. y F/ x  y  =  A  ->  F/_ x A ) )
234, 22impbid2 131 1  |-  ( A. x  A  e.  V  ->  ( F/_ x A  <->  A. y F/ x  y  =  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98   A.wal 1241    = wceq 1243   F/wnf 1349    e. wcel 1393   F/_wnfc 2165   {csn 3375   U.cuni 3580
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-uni 3581
This theorem is referenced by:  eusv2nf  4188
  Copyright terms: Public domain W3C validator