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

Theorem r19.3rmv 3615
Description: Restricted quantification of wff not containing quantified variable. (Contributed by Jim Kingdon, 6-Aug-2018.)
Assertion
Ref Expression
r19.3rmv  |-  ( E. y  y  e.  A  ->  ( ph  <->  A. x  e.  A  ph ) )
Distinct variable groups:    x, A    y, A    ph, x
Allowed substitution hint:    ph( y)

Proof of Theorem r19.3rmv
StepHypRef Expression
1 nfv 1581 . 2  |-  F/ x ph
21r19.3rm 3613 1  |-  ( E. y  y  e.  A  ->  ( ph  <->  A. x  e.  A  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   E.wex 1545    e. wcel 2209   A.wral 2528
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-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-nf 1514  df-cleq 2231  df-clel 2234  df-ral 2533
This theorem is referenced by:  iinconstm  4016  exmidsssnc  4335  cnvpom  5325  ssfilem  7167  ssfilemd  7169  diffitest  7181  inffiexmid  7203  ctssexmid  7480  exmidonfinlem  7535  caucvgsrlemasr  8147  resqrexlemgt0  11764  rmodislmodlem  14659  rmodislmod  14660
  Copyright terms: Public domain W3C validator