| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvrexvw | Unicode version | ||
| Description: Version of cbvrexv 2768 with a disjoint variable condition. (Contributed by GG, 10-Jan-2024.) Reduce axiom usage. (Revised by GG, 25-Aug-2024.) |
| Ref | Expression |
|---|---|
| cbvralvw.1 |
|
| Ref | Expression |
|---|---|
| cbvrexvw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1w 2292 |
. . . 4
| |
| 2 | cbvralvw.1 |
. . . 4
| |
| 3 | 1, 2 | anbi12d 473 |
. . 3
|
| 4 | 3 | cbvexvw 1969 |
. 2
|
| 5 | df-rex 2516 |
. 2
| |
| 6 | df-rex 2516 |
. 2
| |
| 7 | 4, 5, 6 | 3bitr4i 212 |
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 1495 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-clel 2227 df-rex 2516 |
| This theorem is referenced by: cbvrex2vw 2779 zsupssdc 10497 prodmodclem2 12137 prodmodc 12138 pceu 12867 4sqlem12 12974 nninfdclemcl 13068 grprida 13469 dfgrp2 13609 dfgrp3mlem 13680 lss1d 14396 2lgslem1b 15817 bj-charfunbi 16406 |
| Copyright terms: Public domain | W3C validator |