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

Theorem cbval 1634
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.)
Hypotheses
Ref Expression
cbval.1  F/
cbval.2  F/
cbval.3
Assertion
Ref Expression
cbval

Proof of Theorem cbval
StepHypRef Expression
1 cbval.1 . . 3  F/
21nfri 1409 . 2
3 cbval.2 . . 3  F/
43nfri 1409 . 2
5 cbval.3 . 2
62, 4, 5cbvalh 1633 1
Colors of variables: wff set class
Syntax hints:   wi 4   wb 98  wal 1240   F/wnf 1346
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424
This theorem depends on definitions:  df-bi 110  df-nf 1347
This theorem is referenced by:  sb8  1733  cbval2  1793  sb8eu  1910  abbi  2148  cleqf  2198  cbvralf  2521  ralab2  2699  cbvralcsf  2902  dfss2f  2930  elintab  3617  cbviota  4815  sb8iota  4817  dffun6f  4858  dffun4f  4861  mptfvex  5199
  Copyright terms: Public domain W3C validator