| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Change bound variables of triple restricted universal quantification, using implicit substitution. |
| Ref | Expression |
|---|---|
| cbvral3v.1 |
|
| cbvral3v.2 |
|
| cbvral3v.3 |
|
| Ref | Expression |
|---|---|
| cbvral3v |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvral3v.1 |
. . . 4
| |
| 2 | 1 | 2ralbidv 1680 |
. . 3
|
| 3 | 2 | cbvralv 1800 |
. 2
|
| 4 | cbvral3v.2 |
. . . 4
| |
| 5 | cbvral3v.3 |
. . . 4
| |
| 6 | 4, 5 | cbvral2v 1803 |
. . 3
|
| 7 | 6 | ralbii 1667 |
. 2
|
| 8 | 3, 7 | bitr 173 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-12 968 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-ext 1459 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 df-cleq 1469 df-clel 1472 df-ral 1649 |