Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvralvw | Unicode version |
Description: Version of cbvralv 2689 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 |
---|---|
cbvralvw |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1w 2225 | . . . 4 | |
2 | cbvralvw.1 | . . . 4 | |
3 | 1, 2 | imbi12d 233 | . . 3 |
4 | 3 | cbvalvw 1906 | . 2 |
5 | df-ral 2447 | . 2 | |
6 | df-ral 2447 | . 2 | |
7 | 4, 5, 6 | 3bitr4i 211 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wal 1340 wcel 2135 wral 2442 |
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 1434 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 |
This theorem depends on definitions: df-bi 116 df-nf 1448 df-clel 2160 df-ral 2447 |
This theorem is referenced by: cc1 7197 zsupssdc 11872 bj-charfunbi 13528 |
Copyright terms: Public domain | W3C validator |