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

Theorem vtoclgft 2731
Description: Closed theorem form of vtoclgf 2739. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 12-Oct-2016.)
Assertion
Ref Expression
vtoclgft  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  V )  ->  ps )

Proof of Theorem vtoclgft
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 elex 2692 . 2  |-  ( A  e.  V  ->  A  e.  _V )
2 elisset 2695 . . . . 5  |-  ( A  e.  _V  ->  E. z 
z  =  A )
323ad2ant3 1004 . . . 4  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  E. z 
z  =  A )
4 nfnfc1 2282 . . . . . . 7  |-  F/ x F/_ x A
5 nfcvd 2280 . . . . . . . 8  |-  ( F/_ x A  ->  F/_ x
z )
6 id 19 . . . . . . . 8  |-  ( F/_ x A  ->  F/_ x A )
75, 6nfeqd 2294 . . . . . . 7  |-  ( F/_ x A  ->  F/ x  z  =  A )
8 eqeq1 2144 . . . . . . . 8  |-  ( z  =  x  ->  (
z  =  A  <->  x  =  A ) )
98a1i 9 . . . . . . 7  |-  ( F/_ x A  ->  ( z  =  x  ->  (
z  =  A  <->  x  =  A ) ) )
104, 7, 9cbvexd 1897 . . . . . 6  |-  ( F/_ x A  ->  ( E. z  z  =  A  <->  E. x  x  =  A ) )
1110ad2antrr 479 . . . . 5  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph ) )  -> 
( E. z  z  =  A  <->  E. x  x  =  A )
)
12113adant3 1001 . . . 4  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  ( E. z  z  =  A 
<->  E. x  x  =  A ) )
133, 12mpbid 146 . . 3  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  E. x  x  =  A )
14 bi1 117 . . . . . . . . 9  |-  ( (
ph 
<->  ps )  ->  ( ph  ->  ps ) )
1514imim2i 12 . . . . . . . 8  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ph  ->  ps ) ) )
1615com23 78 . . . . . . 7  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( ph  ->  ( x  =  A  ->  ps ) ) )
1716imp 123 . . . . . 6  |-  ( ( ( x  =  A  ->  ( ph  <->  ps )
)  /\  ph )  -> 
( x  =  A  ->  ps ) )
1817alanimi 1435 . . . . 5  |-  ( ( A. x ( x  =  A  ->  ( ph 
<->  ps ) )  /\  A. x ph )  ->  A. x ( x  =  A  ->  ps )
)
19183ad2ant2 1003 . . . 4  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  A. x
( x  =  A  ->  ps ) )
20 simp1r 1006 . . . . 5  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  F/ x ps )
21 19.23t 1655 . . . . 5  |-  ( F/ x ps  ->  ( A. x ( x  =  A  ->  ps )  <->  ( E. x  x  =  A  ->  ps )
) )
2220, 21syl 14 . . . 4  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  ( A. x ( x  =  A  ->  ps )  <->  ( E. x  x  =  A  ->  ps )
) )
2319, 22mpbid 146 . . 3  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  ( E. x  x  =  A  ->  ps ) )
2413, 23mpd 13 . 2  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  _V )  ->  ps )
251, 24syl3an3 1251 1  |-  ( ( ( F/_ x A  /\  F/ x ps )  /\  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A. x ph )  /\  A  e.  V )  ->  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 962   A.wal 1329    = wceq 1331   F/wnf 1436   E.wex 1468    e. wcel 1480   F/_wnfc 2266   _Vcvv 2681
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-3an 964  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683
This theorem is referenced by:  vtocldf  2732
  Copyright terms: Public domain W3C validator