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

Theorem ralxfr2d 4393
Description: Transfer universal quantification from a variable  x to another variable  y contained in expression  A. (Contributed by Mario Carneiro, 20-Aug-2014.)
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
ralxfr2d  |-  ( ph  ->  ( A. x  e.  B  ps  <->  A. 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 ralxfr2d
StepHypRef Expression
1 ralxfr2d.1 . . . 4  |-  ( (
ph  /\  y  e.  C )  ->  A  e.  V )
2 elisset 2703 . . . 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 157 . . . . . . 7  |-  ( ph  ->  ( E. y  e.  C  x  =  A  ->  x  e.  B
) )
6 r19.23v 2544 . . . . . . 7  |-  ( A. y  e.  C  (
x  =  A  ->  x  e.  B )  <->  ( E. y  e.  C  x  =  A  ->  x  e.  B ) )
75, 6sylibr 133 . . . . . 6  |-  ( ph  ->  A. y  e.  C  ( x  =  A  ->  x  e.  B ) )
87r19.21bi 2523 . . . . 5  |-  ( (
ph  /\  y  e.  C )  ->  (
x  =  A  ->  x  e.  B )
)
9 eleq1 2203 . . . . 5  |-  ( x  =  A  ->  (
x  e.  B  <->  A  e.  B ) )
108, 9mpbidi 150 . . . 4  |-  ( (
ph  /\  y  e.  C )  ->  (
x  =  A  ->  A  e.  B )
)
1110exlimdv 1792 . . 3  |-  ( (
ph  /\  y  e.  C )  ->  ( E. x  x  =  A  ->  A  e.  B
) )
123, 11mpd 13 . 2  |-  ( (
ph  /\  y  e.  C )  ->  A  e.  B )
134biimpa 294 . 2  |-  ( (
ph  /\  x  e.  B )  ->  E. y  e.  C  x  =  A )
14 ralxfr2d.3 . 2  |-  ( (
ph  /\  x  =  A )  ->  ( ps 
<->  ch ) )
1512, 13, 14ralxfrd 4391 1  |-  ( ph  ->  ( A. x  e.  B  ps  <->  A. y  e.  C  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1332   E.wex 1469    e. wcel 1481   A.wral 2417   E.wrex 2418
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-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691
This theorem is referenced by:  ralrn  5566  ralima  5665  cnrest2  12444  cnptoprest2  12448
  Copyright terms: Public domain W3C validator