Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrexvw | Unicode version |
Description: Version of cbvrexv 2697 with a disjoint variable condition. (Contributed by Gino Giotto, 10-Jan-2024.) Reduce axiom usage. (Revised by Gino Giotto, 25-Aug-2024.) |
Ref | Expression |
---|---|
cbvralvw.1 |
Ref | Expression |
---|---|
cbvrexvw |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1w 2231 | . . . 4 | |
2 | cbvralvw.1 | . . . 4 | |
3 | 1, 2 | anbi12d 470 | . . 3 |
4 | 3 | cbvexvw 1913 | . 2 |
5 | df-rex 2454 | . 2 | |
6 | df-rex 2454 | . 2 | |
7 | 4, 5, 6 | 3bitr4i 211 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wex 1485 wcel 2141 wrex 2449 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1440 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-clel 2166 df-rex 2454 |
This theorem is referenced by: cbvrex2vw 2708 prodmodclem2 11527 prodmodc 11528 zsupssdc 11896 pceu 12236 grpridd 12628 dfgrp2 12719 bj-charfunbi 13806 |
Copyright terms: Public domain | W3C validator |