Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbviotav | GIF version |
Description: Change bound variables in a description binder. (Contributed by Andrew Salmon, 1-Aug-2011.) |
Ref | Expression |
---|---|
cbviotav.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbviotav | ⊢ (℩𝑥𝜑) = (℩𝑦𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbviotav.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
2 | nfv 1516 | . 2 ⊢ Ⅎ𝑦𝜑 | |
3 | nfv 1516 | . 2 ⊢ Ⅎ𝑥𝜓 | |
4 | 1, 2, 3 | cbviota 5158 | 1 ⊢ (℩𝑥𝜑) = (℩𝑦𝜓) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1343 ℩cio 5151 |
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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rex 2450 df-sn 3582 df-uni 3790 df-iota 5153 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |