Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbv3h | Structured version Visualization version Unicode version |
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 8-Jun-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 12-May-2018.) |
Ref | Expression |
---|---|
cbv3h.1 | |
cbv3h.2 | |
cbv3h.3 |
Ref | Expression |
---|---|
cbv3h |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbv3h.1 | . . 3 | |
2 | 1 | nf5i 2024 | . 2 |
3 | cbv3h.2 | . . 3 | |
4 | 3 | nf5i 2024 | . 2 |
5 | cbv3h.3 | . 2 | |
6 | 2, 4, 5 | cbv3 2265 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wal 1481 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-nf 1710 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |