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 1521 | . 2 | |
2 | nfvd 1522 | . 2 | |
3 | cbvaldva.1 | . . 3 | |
4 | 3 | ex 114 | . 2 |
5 | 1, 2, 4 | cbvexd 1920 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wex 1485 |
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-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 |
This theorem depends on definitions: df-bi 116 df-nf 1454 |
This theorem is referenced by: cbvrexdva2 2704 acexmid 5850 tfrlemi1 6309 ltexpri 7564 recexpr 7589 |
Copyright terms: Public domain | W3C validator |