| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvrex2vw | Unicode version | ||
| Description: Change bound variables of double restricted universal quantification, using implicit substitution. Version of cbvrex2v 2752 with a disjoint variable condition, which does not require ax-13 2178. (Contributed by FL, 2-Jul-2012.) (Revised by GG, 10-Jan-2024.) |
| Ref | Expression |
|---|---|
| cbvrex2vw.1 |
|
| cbvrex2vw.2 |
|
| Ref | Expression |
|---|---|
| cbvrex2vw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvrex2vw.1 |
. . . 4
| |
| 2 | 1 | rexbidv 2507 |
. . 3
|
| 3 | 2 | cbvrexvw 2743 |
. 2
|
| 4 | cbvrex2vw.2 |
. . . 4
| |
| 5 | 4 | cbvrexvw 2743 |
. . 3
|
| 6 | 5 | rexbii 2513 |
. 2
|
| 7 | 3, 6 | bitri 184 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1470 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1484 df-clel 2201 df-rex 2490 |
| This theorem is referenced by: 4sqlem2 12712 2sqlem9 15601 |
| Copyright terms: Public domain | W3C validator |