| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rule used to change bound variables with implicit substitution. |
| Ref | Expression |
|---|---|
| cbval2v.1 |
|
| Ref | Expression |
|---|---|
| cbvex2v |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 968 |
. 2
| |
| 2 | ax-17 968 |
. 2
| |
| 3 | ax-17 968 |
. 2
| |
| 4 | ax-17 968 |
. 2
| |
| 5 | cbval2v.1 |
. 2
| |
| 6 | 1, 2, 3, 4, 5 | cbvex2 1312 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cbvex4v 1317 2mo 1440 2eu6 1447 th3qlem1 4298 genpv 5074 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-12 965 ax-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 978 |