Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvsbc | Structured version Visualization version Unicode version |
Description: Change bound variables in a wff substitution. (Contributed by Jeff Hankins, 19-Sep-2009.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) |
Ref | Expression |
---|---|
cbvsbc.1 | |
cbvsbc.2 | |
cbvsbc.3 |
Ref | Expression |
---|---|
cbvsbc |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvsbc.1 | . . . 4 | |
2 | cbvsbc.2 | . . . 4 | |
3 | cbvsbc.3 | . . . 4 | |
4 | 1, 2, 3 | cbvab 2746 | . . 3 |
5 | 4 | eleq2i 2693 | . 2 |
6 | df-sbc 3436 | . 2 | |
7 | df-sbc 3436 | . 2 | |
8 | 5, 6, 7 | 3bitr4i 292 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wnf 1708 wcel 1990 cab 2608 wsbc 3435 |
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-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
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-clab 2609 df-cleq 2615 df-clel 2618 df-sbc 3436 |
This theorem is referenced by: cbvsbcv 3465 cbvcsb 3538 |
Copyright terms: Public domain | W3C validator |