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

Theorem cbvoprab3v 6178
 Description: Rule used to change the third bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 8-Oct-2004.) (Revised by David Abernethy, 19-Jun-2012.)
Hypothesis
Ref Expression
cbvoprab3v.1
Assertion
Ref Expression
cbvoprab3v
Distinct variable groups:   ,,   ,,   ,   ,
Allowed substitution hints:   (,,)   (,,)

Proof of Theorem cbvoprab3v
StepHypRef Expression
1 nfv 1630 . 2
2 nfv 1630 . 2
3 cbvoprab3v.1 . 2
41, 2, 3cbvoprab3 6177 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 178   wceq 1653  coprab 6111 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1668  ax-8 1689  ax-14 1731  ax-6 1746  ax-7 1751  ax-11 1763  ax-12 1953  ax-ext 2423  ax-sep 4355  ax-nul 4363  ax-pr 4432 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-ne 2607  df-rab 2720  df-v 2964  df-dif 3309  df-un 3311  df-in 3313  df-ss 3320  df-nul 3614  df-if 3764  df-sn 3844  df-pr 3845  df-op 3847  df-opab 4292  df-oprab 6114
 Copyright terms: Public domain W3C validator