| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvrexdva | Unicode version | ||
| Description: Rule used to change the bound variable in a restricted existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| cbvraldva.1 |
|
| Ref | Expression |
|---|---|
| cbvrexdva |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvraldva.1 |
. 2
| |
| 2 | eqidd 2205 |
. 2
| |
| 3 | 1, 2 | cbvrexdva2 2745 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-nf 1483 df-cleq 2197 df-clel 2200 df-rex 2489 |
| This theorem is referenced by: tfrlem3ag 6394 tfrlem3a 6395 tfrlemi1 6417 tfr1onlem3ag 6422 |
| Copyright terms: Public domain | W3C validator |