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

Theorem r19.3rmv 3559
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 1552 . 2  |-  F/ x ph
21r19.3rm 3557 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 1516    e. wcel 2178   A.wral 2486
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-nf 1485  df-cleq 2200  df-clel 2203  df-ral 2491
This theorem is referenced by:  iinconstm  3950  exmidsssnc  4263  cnvpom  5244  ssfilem  6998  diffitest  7010  inffiexmid  7029  ctssexmid  7278  exmidonfinlem  7332  caucvgsrlemasr  7938  resqrexlemgt0  11446  rmodislmodlem  14227  rmodislmod  14228
  Copyright terms: Public domain W3C validator