| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reueq1f | Structured version Visualization version GIF version | ||
| Description: Equality theorem for restricted unique existential quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 5-Apr-2004.) (Revised by Andrew Salmon, 11-Jul-2011.) |
| Ref | Expression |
|---|---|
| rmoeq1f.1 | ⊢ Ⅎ𝑥𝐴 |
| rmoeq1f.2 | ⊢ Ⅎ𝑥𝐵 |
| Ref | Expression |
|---|---|
| reueq1f | ⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rmoeq1f.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 2 | rmoeq1f.2 | . . . 4 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | rexeqf 3346 | . . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐵 𝜑)) |
| 4 | 1, 2 | rmoeq1f 3406 | . . 3 ⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑)) |
| 5 | 3, 4 | anbi12d 641 | . 2 ⊢ (𝐴 = 𝐵 → ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑥 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐵 𝜑))) |
| 6 | reu5 3371 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑)) | |
| 7 | reu5 3371 | . 2 ⊢ (∃!𝑥 ∈ 𝐵 𝜑 ↔ (∃𝑥 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐵 𝜑)) | |
| 8 | 5, 6, 7 | 3bitr4g 316 | 1 ⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 Ⅎwnfc 2911 ∃wrex 3088 ∃!wreu 3367 ∃*wrmo 3368 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1565 df-ex 1802 df-nf 1806 df-mo 2568 df-eu 2598 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |