| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reueq1OLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of reueq1 3400 as of 12-Mar-2025. (Contributed by NM, 5-Apr-2004.) Remove usage of ax-10 2140, ax-11 2156, and ax-12 2176. (Revised by Steven Nguyen, 30-Apr-2023.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| reueq1OLD | ⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 2822 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 2 | 1 | anbi1d 631 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑))) |
| 3 | 2 | eubidv 2584 | . 2 ⊢ (𝐴 = 𝐵 → (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))) |
| 4 | df-reu 3364 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 5 | df-reu 3364 | . 2 ⊢ (∃!𝑥 ∈ 𝐵 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)) | |
| 6 | 3, 4, 5 | 3bitr4g 314 | 1 ⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2107 ∃!weu 2566 ∃!wreu 3361 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1779 df-mo 2538 df-eu 2567 df-cleq 2726 df-clel 2808 df-reu 3364 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |