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

Theorem ralxfrALT 4498
Description: Transfer universal quantification from a variable  x to another variable  y contained in expression  A. This proof does not use ralxfrd 4493. (Contributed by NM, 10-Jun-2005.) (Revised by Mario Carneiro, 15-Aug-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
ralxfr.1  |-  ( y  e.  C  ->  A  e.  B )
ralxfr.2  |-  ( x  e.  B  ->  E. y  e.  C  x  =  A )
ralxfr.3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
ralxfrALT  |-  ( A. x  e.  B  ph  <->  A. y  e.  C  ps )
Distinct variable groups:    ps, x    ph, y    x, A    x, y, B   
x, C
Allowed substitution hints:    ph( x)    ps( y)    A( y)    C( y)

Proof of Theorem ralxfrALT
StepHypRef Expression
1 ralxfr.1 . . . . 5  |-  ( y  e.  C  ->  A  e.  B )
2 ralxfr.3 . . . . . 6  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
32rspcv 2860 . . . . 5  |-  ( A  e.  B  ->  ( A. x  e.  B  ph 
->  ps ) )
41, 3syl 14 . . . 4  |-  ( y  e.  C  ->  ( A. x  e.  B  ph 
->  ps ) )
54com12 30 . . 3  |-  ( A. x  e.  B  ph  ->  ( y  e.  C  ->  ps ) )
65ralrimiv 2566 . 2  |-  ( A. x  e.  B  ph  ->  A. y  e.  C  ps )
7 ralxfr.2 . . . 4  |-  ( x  e.  B  ->  E. y  e.  C  x  =  A )
8 nfra1 2525 . . . . 5  |-  F/ y A. y  e.  C  ps
9 nfv 1539 . . . . 5  |-  F/ y
ph
10 rsp 2541 . . . . . 6  |-  ( A. y  e.  C  ps  ->  ( y  e.  C  ->  ps ) )
112biimprcd 160 . . . . . 6  |-  ( ps 
->  ( x  =  A  ->  ph ) )
1210, 11syl6 33 . . . . 5  |-  ( A. y  e.  C  ps  ->  ( y  e.  C  ->  ( x  =  A  ->  ph ) ) )
138, 9, 12rexlimd 2608 . . . 4  |-  ( A. y  e.  C  ps  ->  ( E. y  e.  C  x  =  A  ->  ph ) )
147, 13syl5 32 . . 3  |-  ( A. y  e.  C  ps  ->  ( x  e.  B  ->  ph ) )
1514ralrimiv 2566 . 2  |-  ( A. y  e.  C  ps  ->  A. x  e.  B  ph )
166, 15impbii 126 1  |-  ( A. x  e.  B  ph  <->  A. y  e.  C  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1364    e. wcel 2164   A.wral 2472   E.wrex 2473
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator