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

Theorem cbv3 1627
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 12-May-2018.)
Hypotheses
Ref Expression
cbv3.1  F/
cbv3.2  F/
cbv3.3
Assertion
Ref Expression
cbv3

Proof of Theorem cbv3
StepHypRef Expression
1 cbv3.1 . . 3  F/
21nfal 1465 . 2  F/
3 cbv3.2 . . 3  F/
4 cbv3.3 . . 3
53, 4spim 1623 . 2
62, 5alrimi 1412 1
Colors of variables: wff set class
Syntax hints:   wi 4  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-4 1397  ax-i9 1420  ax-ial 1424
This theorem depends on definitions:  df-bi 110  df-nf 1347
This theorem is referenced by:  cbv3h  1628  cbv1  1629  mo2n  1925  mo23  1938  setindis  9397  bdsetindis  9399
  Copyright terms: Public domain W3C validator