| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvraldva | Structured version Visualization version Unicode version | ||
| Description: Rule used to change the bound variable in a restricted universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| cbvraldva.1 |
|
| Ref | Expression |
|---|---|
| cbvraldva |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvraldva.1 |
. 2
| |
| 2 | eqidd 2623 |
. 2
| |
| 3 | 1, 2 | cbvraldva2 3175 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| 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-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
| This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-cleq 2615 df-clel 2618 df-ral 2917 |
| This theorem is referenced by: wrd2ind 13477 axtgcont 25368 |
| Copyright terms: Public domain | W3C validator |