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

Theorem rexxfr2d 4467
Description: Transfer universal quantification from a variable  x to another variable  y contained in expression  A. (Contributed by Mario Carneiro, 20-Aug-2014.) (Proof shortened by Mario Carneiro, 19-Nov-2016.)
Hypotheses
Ref Expression
ralxfr2d.1  |-  ( (
ph  /\  y  e.  C )  ->  A  e.  V )
ralxfr2d.2  |-  ( ph  ->  ( x  e.  B  <->  E. y  e.  C  x  =  A ) )
ralxfr2d.3  |-  ( (
ph  /\  x  =  A )  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
rexxfr2d  |-  ( ph  ->  ( E. x  e.  B  ps  <->  E. y  e.  C  ch )
)
Distinct variable groups:    x, A    x, y, B    x, C    ch, x    ph, x, y    ps, y
Allowed substitution hints:    ps( x)    ch( y)    A( y)    C( y)    V( x, y)

Proof of Theorem rexxfr2d
StepHypRef Expression
1 ralxfr2d.1 . . . 4  |-  ( (
ph  /\  y  e.  C )  ->  A  e.  V )
2 elisset 2753 . . . 4  |-  ( A  e.  V  ->  E. x  x  =  A )
31, 2syl 14 . . 3  |-  ( (
ph  /\  y  e.  C )  ->  E. x  x  =  A )
4 ralxfr2d.2 . . . . . . . 8  |-  ( ph  ->  ( x  e.  B  <->  E. y  e.  C  x  =  A ) )
54biimprd 158 . . . . . . 7  |-  ( ph  ->  ( E. y  e.  C  x  =  A  ->  x  e.  B
) )
6 r19.23v 2586 . . . . . . 7  |-  ( A. y  e.  C  (
x  =  A  ->  x  e.  B )  <->  ( E. y  e.  C  x  =  A  ->  x  e.  B ) )
75, 6sylibr 134 . . . . . 6  |-  ( ph  ->  A. y  e.  C  ( x  =  A  ->  x  e.  B ) )
87r19.21bi 2565 . . . . 5  |-  ( (
ph  /\  y  e.  C )  ->  (
x  =  A  ->  x  e.  B )
)
9 eleq1 2240 . . . . 5  |-  ( x  =  A  ->  (
x  e.  B  <->  A  e.  B ) )
108, 9mpbidi 151 . . . 4  |-  ( (
ph  /\  y  e.  C )  ->  (
x  =  A  ->  A  e.  B )
)
1110exlimdv 1819 . . 3  |-  ( (
ph  /\  y  e.  C )  ->  ( E. x  x  =  A  ->  A  e.  B
) )
123, 11mpd 13 . 2  |-  ( (
ph  /\  y  e.  C )  ->  A  e.  B )
134biimpa 296 . 2  |-  ( (
ph  /\  x  e.  B )  ->  E. y  e.  C  x  =  A )
14 ralxfr2d.3 . 2  |-  ( (
ph  /\  x  =  A )  ->  ( ps 
<->  ch ) )
1512, 13, 14rexxfrd 4465 1  |-  ( ph  ->  ( E. x  e.  B  ps  <->  E. y  e.  C  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353   E.wex 1492    e. wcel 2148   A.wral 2455   E.wrex 2456
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741
This theorem is referenced by:  rexrn  5655  rexima  5757  cnptopresti  13777  cnptoprest  13778  txrest  13815
  Copyright terms: Public domain W3C validator