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

Theorem vtoclgft 2604
Description: Closed theorem form of vtoclgf 2612. (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 2566 . 2  |-  ( A  e.  V  ->  A  e.  _V )
2 elisset 2568 . . . . 5  |-  ( A  e.  _V  ->  E. z 
z  =  A )
323ad2ant3 927 . . . 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 2181 . . . . . . 7  |-  F/ x F/_ x A
5 nfcvd 2179 . . . . . . . 8  |-  ( F/_ x A  ->  F/_ x
z )
6 id 19 . . . . . . . 8  |-  ( F/_ x A  ->  F/_ x A )
75, 6nfeqd 2192 . . . . . . 7  |-  ( F/_ x A  ->  F/ x  z  =  A )
8 eqeq1 2046 . . . . . . . 8  |-  ( z  =  x  ->  (
z  =  A  <->  x  =  A ) )
98a1i 9 . . . . . . 7  |-  ( F/_ x A  ->  ( z  =  x  ->  (
z  =  A  <->  x  =  A ) ) )
104, 7, 9cbvexd 1802 . . . . . 6  |-  ( F/_ x A  ->  ( E. z  z  =  A  <->  E. x  x  =  A ) )
1110ad2antrr 457 . . . . 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 924 . . . 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 135 . . 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 111 . . . . . . . . 9  |-  ( (
ph 
<->  ps )  ->  ( ph  ->  ps ) )
1514imim2i 12 . . . . . . . 8  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ph  ->  ps ) ) )
1615com23 72 . . . . . . 7  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( ph  ->  ( x  =  A  ->  ps ) ) )
1716imp 115 . . . . . 6  |-  ( ( ( x  =  A  ->  ( ph  <->  ps )
)  /\  ph )  -> 
( x  =  A  ->  ps ) )
1817alanimi 1348 . . . . 5  |-  ( ( A. x ( x  =  A  ->  ( ph 
<->  ps ) )  /\  A. x ph )  ->  A. x ( x  =  A  ->  ps )
)
19183ad2ant2 926 . . . 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 929 . . . . 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 1567 . . . . 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 135 . . 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 1170 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 97    <-> wb 98    /\ w3a 885   A.wal 1241    = wceq 1243   F/wnf 1349   E.wex 1381    e. wcel 1393   F/_wnfc 2165   _Vcvv 2557
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-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  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-3an 887  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559
This theorem is referenced by:  vtocldf  2605
  Copyright terms: Public domain W3C validator