Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvmo | Structured version Visualization version Unicode version |
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 9-Mar-1995.) (Revised by Andrew Salmon, 8-Jun-2011.) |
Ref | Expression |
---|---|
cbvmo.1 | |
cbvmo.2 | |
cbvmo.3 |
Ref | Expression |
---|---|
cbvmo |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvmo.1 | . . . 4 | |
2 | cbvmo.2 | . . . 4 | |
3 | cbvmo.3 | . . . 4 | |
4 | 1, 2, 3 | cbvex 2272 | . . 3 |
5 | 1, 2, 3 | cbveu 2505 | . . 3 |
6 | 4, 5 | imbi12i 340 | . 2 |
7 | df-mo 2475 | . 2 | |
8 | df-mo 2475 | . 2 | |
9 | 6, 7, 8 | 3bitr4i 292 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wex 1704 wnf 1708 weu 2470 wmo 2471 |
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-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 |
This theorem is referenced by: dffun6f 5902 opabiotafun 6259 2ndcdisj 21259 cbvdisjf 29385 phpreu 33393 |
Copyright terms: Public domain | W3C validator |