Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrmov | Unicode version |
Description: Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by Alexander van der Vekens, 17-Jun-2017.) |
Ref | Expression |
---|---|
cbvralv.1 |
Ref | Expression |
---|---|
cbvrmov |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1461 | . 2 | |
2 | nfv 1461 | . 2 | |
3 | cbvralv.1 | . 2 | |
4 | 1, 2, 3 | cbvrmo 2576 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 103 wrmo 2351 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-cleq 2074 df-clel 2077 df-nfc 2208 df-rex 2354 df-reu 2355 df-rmo 2356 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |