Higher-Order Logic Explorer		< Previous   Next > Nearby theorems
Mirrors  >  Home  >  HOLE Home  >  Th. List  >  cbv		Unicode version

---

Theorem cbv 168

Description: Change bound variables in a lambda abstraction.

Hypotheses

Ref	Expression
cbv.1
cbv.2

Assertion

Ref	Expression
cbv

Distinct variable groups:   ,   ,   ,,   ,

---

Proof of Theorem cbv Dummy variable is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbv.1	. 2
2		wv 58	. . 3
3	1, 2	ax-17 95	. 2
4		cbv.2	. . . 4
5	1, 4	eqtypi 69	. . 3
6	5, 2	ax-17 95	. 2
7	1, 3, 6, 4	cbvf 167	1

Colors of variables: type var term

Syntax hints:  tv 1  kl 6   ke 7  kt 8  kbr 9   wffMMJ2 11  wffMMJ2t 12

This theorem was proved from axioms:  ax-syl 15  ax-jca 17  ax-simpl 20  ax-simpr 21  ax-id 24  ax-trud 26  ax-cb1 29  ax-cb2 30  ax-refl 39  ax-eqmp 42  ax-ded 43  ax-ceq 46  ax-beta 60  ax-distrc 61  ax-leq 62  ax-distrl 63  ax-hbl1 93  ax-17 95  ax-inst 103  ax-eta 165

This theorem depends on definitions:  df-ov 65  df-al 116

This theorem is referenced by:  ax10  200

Copyright terms: Public domain

W3C validator