Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvexdva | Unicode version |
Description: Rule used to change the bound variable in an existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.) |
Ref | Expression |
---|---|
cbvaldva.1 |
Ref | Expression |
---|---|
cbvexdva |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1461 | . 2 | |
2 | nfvd 1462 | . 2 | |
3 | cbvaldva.1 | . . 3 | |
4 | 3 | ex 113 | . 2 |
5 | 1, 2, 4 | cbvexd 1843 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 wex 1421 |
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-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 |
This theorem depends on definitions: df-bi 115 df-nf 1390 |
This theorem is referenced by: cbvrexdva2 2582 acexmid 5531 tfrlemi1 5969 ltexpri 6803 recexpr 6828 |
Copyright terms: Public domain | W3C validator |