Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvreuv | Structured version Visualization version Unicode version |
Description: Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by NM, 5-Apr-2004.) (Revised by Mario Carneiro, 15-Oct-2016.) |
Ref | Expression |
---|---|
cbvralv.1 |
Ref | Expression |
---|---|
cbvreuv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1843 | . 2 | |
2 | nfv 1843 | . 2 | |
3 | cbvralv.1 | . 2 | |
4 | 1, 2, 3 | cbvreu 3169 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wreu 2914 |
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-eu 2474 df-cleq 2615 df-clel 2618 df-reu 2919 |
This theorem is referenced by: reu8 3402 aceq1 8940 aceq2 8942 fin23lem27 9150 divalglem10 15125 lspsneu 19123 lshpsmreu 34396 wessf1ornlem 39371 fourierdlem50 40373 |
Copyright terms: Public domain | W3C validator |