Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrmo | Unicode version |
Description: Change the bound variable of restricted "at most one" using implicit substitution. (Contributed by NM, 16-Jun-2017.) |
Ref | Expression |
---|---|
cbvral.1 | |
cbvral.2 | |
cbvral.3 |
Ref | Expression |
---|---|
cbvrmo |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvral.1 | . . . 4 | |
2 | cbvral.2 | . . . 4 | |
3 | cbvral.3 | . . . 4 | |
4 | 1, 2, 3 | cbvrex 2689 | . . 3 |
5 | 1, 2, 3 | cbvreu 2690 | . . 3 |
6 | 4, 5 | imbi12i 238 | . 2 |
7 | rmo5 2681 | . 2 | |
8 | rmo5 2681 | . 2 | |
9 | 6, 7, 8 | 3bitr4i 211 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1448 wrex 2445 wreu 2446 wrmo 2447 |
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-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rex 2450 df-reu 2451 df-rmo 2452 |
This theorem is referenced by: cbvrmov 2695 cbvdisj 3969 |
Copyright terms: Public domain | W3C validator |