| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvralvw | Unicode version | ||
| Description: Version of cbvralv 2786 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 |
|---|---|
| cbvralvw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1w 2299 |
. . . 4
| |
| 2 | cbvralvw.1 |
. . . 4
| |
| 3 | 1, 2 | imbi12d 234 |
. . 3
|
| 4 | 3 | cbvalvw 1975 |
. 2
|
| 5 | df-ral 2533 |
. 2
| |
| 6 | df-ral 2533 |
. 2
| |
| 7 | 4, 5, 6 | 3bitr4i 212 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1500 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 |
| This proof depends on definitions: df-bi 117 df-nf 1514 df-clel 2234 df-ral 2533 |
| This theorem is used by: cbvral2vw 2797 cc1 7632 zsupssdc 10684 hashfibc 11299 wrdind 11510 wrd2ind 11511 reuccatpfxs1 11535 prmpwdvds 13157 nninfdclemcl 13391 grpinvalem 13758 grpinva 13759 issubg4m 14049 isnsg2 14059 elnmz 14064 fsumdvdsmul 16246 2sqlem6 16405 2sqlem10 16410 uspgr2wlkeq 16772 depindlem1 16913 bj-charfunbi 17003 |
| Copyright terms: Public domain | W3C validator |