| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvreuw | GIF version | ||
| Description: Change the bound variable of a restricted unique existential quantifier using implicit substitution. Version of cbvreu 2765 with a disjoint variable condition. (Contributed by Mario Carneiro, 15-Oct-2016.) (Revised by GG, 10-Jan-2024.) (Revised by Wolf Lammen, 10-Dec-2024.) |
| Ref | Expression |
|---|---|
| cbvreuw.1 | ⊢ Ⅎ𝑦𝜑 |
| cbvreuw.2 | ⊢ Ⅎ𝑥𝜓 |
| cbvreuw.3 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| cbvreuw | ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvreuw.1 | . . . 4 ⊢ Ⅎ𝑦𝜑 | |
| 2 | cbvreuw.2 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
| 3 | cbvreuw.3 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 4 | 1, 2, 3 | cbvrexw 2761 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 𝜓) |
| 5 | 1, 2, 3 | cbvrmow 2716 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓) |
| 6 | 4, 5 | anbi12i 460 | . 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑦 ∈ 𝐴 𝜓 ∧ ∃*𝑦 ∈ 𝐴 𝜓)) |
| 7 | reu5 2751 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑)) | |
| 8 | reu5 2751 | . 2 ⊢ (∃!𝑦 ∈ 𝐴 𝜓 ↔ (∃𝑦 ∈ 𝐴 𝜓 ∧ ∃*𝑦 ∈ 𝐴 𝜓)) | |
| 9 | 6, 7, 8 | 3bitr4i 212 | 1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 Ⅎwnf 1508 ∃wrex 2511 ∃!wreu 2512 ∃*wrmo 2513 |
| 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-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-cleq 2224 df-clel 2227 df-nfc 2363 df-rex 2516 df-reu 2517 df-rmo 2518 |
| This theorem is referenced by: reu8nf 3113 |
| Copyright terms: Public domain | W3C validator |