MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbcco3gOLD Unicode version

Theorem sbcco3gOLD 3137
Description: Composition of two substitutions. (Contributed by NM, 27-Nov-2005.) (New usage is discouraged.)
Hypothesis
Ref Expression
sbcco3g.1  |-  ( x  =  A  ->  B  =  C )
Assertion
Ref Expression
sbcco3gOLD  |-  ( ( A  e.  V  /\  A. x  B  e.  W
)  ->  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. C  / 
y ]. ph ) )
Distinct variable groups:    x, A    ph, x    x, C
Allowed substitution hints:    ph( y)    A( y)    B( x, y)    C( y)    V( x, y)    W( x, y)

Proof of Theorem sbcco3gOLD
StepHypRef Expression
1 sbcco3g.1 . . 3  |-  ( x  =  A  ->  B  =  C )
21sbcco3g 3136 . 2  |-  ( A  e.  V  ->  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. C  /  y ]. ph ) )
32adantr 451 1  |-  ( ( A  e.  V  /\  A. x  B  e.  W
)  ->  ( [. A  /  x ]. [. B  /  y ]. ph  <->  [. C  / 
y ]. ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   A.wal 1527    = wceq 1623    e. wcel 1684   [.wsbc 2991
This theorem is referenced by:  fzshftral  10869  2rexfrabdioph  26877  3rexfrabdioph  26878  4rexfrabdioph  26879  6rexfrabdioph  26880  7rexfrabdioph  26881
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-v 2790  df-sbc 2992  df-csb 3082
  Copyright terms: Public domain W3C validator