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

Theorem cbv3h 1679
 Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 12-May-2018.)
Hypotheses
Ref Expression
cbv3h.1
cbv3h.2
cbv3h.3
Assertion
Ref Expression
cbv3h

Proof of Theorem cbv3h
StepHypRef Expression
1 cbv3h.1 . . 3
21nfi 1397 . 2
3 cbv3h.2 . . 3
43nfi 1397 . 2
5 cbv3h.3 . 2
62, 4, 5cbv3 1678 1
 Colors of variables: wff set class Syntax hints:   wi 4  wal 1288 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-4 1446  ax-i9 1469  ax-ial 1473 This theorem depends on definitions:  df-bi 116  df-nf 1396 This theorem is referenced by:  cbvalh  1684  ax16  1742  ax16i  1787  cleqh  2188
 Copyright terms: Public domain W3C validator