Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrmov | Unicode version |
Description: Change the bound variable of a restricted at-most-one 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 1493 | . 2 | |
2 | nfv 1493 | . 2 | |
3 | cbvralv.1 | . 2 | |
4 | 1, 2, 3 | cbvrmo 2630 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wrmo 2396 |
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 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-tru 1319 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-cleq 2110 df-clel 2113 df-nfc 2247 df-rex 2399 df-reu 2400 df-rmo 2401 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |