Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvex4v | Structured version Visualization version Unicode version |
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 26-Jul-1995.) |
Ref | Expression |
---|---|
cbvex4v.1 | |
cbvex4v.2 |
Ref | Expression |
---|---|
cbvex4v |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvex4v.1 | . . . 4 | |
2 | 1 | 2exbidv 1852 | . . 3 |
3 | 2 | cbvex2v 2287 | . 2 |
4 | cbvex4v.2 | . . . 4 | |
5 | 4 | cbvex2v 2287 | . . 3 |
6 | 5 | 2exbii 1775 | . 2 |
7 | 3, 6 | bitri 264 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wex 1704 |
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-11 2034 ax-12 2047 ax-13 2246 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 |
This theorem is referenced by: addsrmo 9894 mulsrmo 9895 |
Copyright terms: Public domain | W3C validator |