| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rule used to change bound variables with implicit substitution. |
| Ref | Expression |
|---|---|
| cbvalv.1 |
|
| Ref | Expression |
|---|---|
| cbvalv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 925 |
. 2
| |
| 2 | ax-17 925 |
. 2
| |
| 3 | cbvalv.1 |
. 2
| |
| 4 | 1, 2, 3 | cbval 848 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: axpow 1082 axinf 1084 axac 1085 pssnn 3428 inf0 3457 aceq0 3553 aceq3 3556 aceq5 3563 kmlem1 3580 kmlem12 3591 zfcndpow 3762 zfcndinf 3764 zfcndac 3765 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-12 802 ax-17 925 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 |