| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reuxfr | Structured version Visualization version GIF version | ||
| Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. (Contributed by NM, 14-Nov-2004.) (Revised by NM, 16-Jun-2017.) |
| Ref | Expression |
|---|---|
| reuxfr.1 | ⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵) |
| reuxfr.2 | ⊢ (𝑥 ∈ 𝐵 → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴) |
| Ref | Expression |
|---|---|
| reuxfr | ⊢ (∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜑) ↔ ∃!𝑦 ∈ 𝐶 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reuxfr.1 | . . . 4 ⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵) | |
| 2 | 1 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵) |
| 3 | reuxfr.2 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴) | |
| 4 | 3 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → ∃*𝑦 ∈ 𝐶 𝑥 = 𝐴) |
| 5 | 2, 4 | reuxfrd 3713 | . 2 ⊢ (⊤ → (∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜑) ↔ ∃!𝑦 ∈ 𝐶 𝜑)) |
| 6 | 5 | mptru 1577 | 1 ⊢ (∃!𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 (𝑥 = 𝐴 ∧ 𝜑) ↔ ∃!𝑦 ∈ 𝐶 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ⊤wtru 1571 ∈ wcel 2146 ∃wrex 3091 ∃!wreu 3369 ∃*wrmo 3370 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |