![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cbvreuvw | Structured version Visualization version GIF version |
Description: Change the bound variable of a restricted unique existential quantifier using implicit substitution. Version of cbvreuv 3421 with a disjoint variable condition, which requires fewer axioms. (Contributed by NM, 5-Apr-2004.) (Revised by Gino Giotto, 30-Sep-2024.) |
Ref | Expression |
---|---|
cbvrmovw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvreuvw | ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1w 2810 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
2 | cbvrmovw.1 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
3 | 1, 2 | anbi12d 630 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓))) |
4 | 3 | cbveuvw 2594 | . 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) |
5 | df-reu 3371 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
6 | df-reu 3371 | . 2 ⊢ (∃!𝑦 ∈ 𝐴 𝜓 ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) | |
7 | 4, 5, 6 | 3bitr4i 303 | 1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑦 ∈ 𝐴 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2098 ∃!weu 2556 ∃!wreu 3368 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1774 df-mo 2528 df-eu 2557 df-clel 2804 df-reu 3371 |
This theorem is referenced by: reu8 3724 aceq1 10114 aceq2 10116 fin23lem27 10325 divalglem10 16352 lspsneu 20974 lshpsmreu 38492 wessf1ornlem 44453 fourierdlem50 45441 |
Copyright terms: Public domain | W3C validator |