| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvrmow | Unicode version | ||
| Description: Change the bound variable of a restricted at-most-one quantifier using implicit substitution. Version of cbvrmo 2766 with a disjoint variable condition. (Contributed by NM, 16-Jun-2017.) (Revised by GG, 23-May-2024.) |
| Ref | Expression |
|---|---|
| cbvrmow.1 |
|
| cbvrmow.2 |
|
| cbvrmow.3 |
|
| Ref | Expression |
|---|---|
| cbvrmow |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1576 |
. . . 4
| |
| 2 | cbvrmow.1 |
. . . 4
| |
| 3 | 1, 2 | nfan 1613 |
. . 3
|
| 4 | nfv 1576 |
. . . 4
| |
| 5 | cbvrmow.2 |
. . . 4
| |
| 6 | 4, 5 | nfan 1613 |
. . 3
|
| 7 | eleq1w 2292 |
. . . 4
| |
| 8 | cbvrmow.3 |
. . . 4
| |
| 9 | 7, 8 | anbi12d 473 |
. . 3
|
| 10 | 3, 6, 9 | cbvmow 2120 |
. 2
|
| 11 | df-rmo 2518 |
. 2
| |
| 12 | df-rmo 2518 |
. 2
| |
| 13 | 10, 11, 12 | 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-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clel 2227 df-rmo 2518 |
| This theorem is referenced by: cbvreuw 2762 |
| Copyright terms: Public domain | W3C validator |