| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reuxfr1 | Structured version Visualization version GIF version | ||
| Description: Transfer existential uniqueness from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. Use reuhyp 5386 to eliminate the second hypothesis. (Contributed by NM, 14-Nov-2004.) |
| Ref | Expression |
|---|---|
| reuxfr1.1 | ⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵) |
| reuxfr1.2 | ⊢ (𝑥 ∈ 𝐵 → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴) |
| reuxfr1.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| reuxfr1 | ⊢ (∃!𝑥 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐶 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reuxfr1.1 | . . . 4 ⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵) | |
| 2 | 1 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑦 ∈ 𝐶) → 𝐴 ∈ 𝐵) |
| 3 | reuxfr1.2 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴) | |
| 4 | 3 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = 𝐴) |
| 5 | reuxfr1.3 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 6 | 2, 4, 5 | reuxfr1ds 3712 | . 2 ⊢ (⊤ → (∃!𝑥 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐶 𝜓)) |
| 7 | 6 | mptru 1577 | 1 ⊢ (∃!𝑥 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐶 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ⊤wtru 1571 ∈ wcel 2147 ∃!wreu 3367 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 |
| This theorem is used by: zmax 13096 rebtwnz 13098 |
| Copyright terms: Public domain | W3C validator |