![]() |
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 3350 | . . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐵 𝜑)) |
4 | 1, 2 | rmoeq1f 3420 | . . 3 ⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑)) |
5 | 3, 4 | anbi12d 631 | . 2 ⊢ (𝐴 = 𝐵 → ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑥 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐵 𝜑))) |
6 | reu5 3378 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥 ∈ 𝐴 𝜑)) | |
7 | reu5 3378 | . 2 ⊢ (∃!𝑥 ∈ 𝐵 𝜑 ↔ (∃𝑥 ∈ 𝐵 𝜑 ∧ ∃*𝑥 ∈ 𝐵 𝜑)) | |
8 | 5, 6, 7 | 3bitr4g 313 | 1 ⊢ (𝐴 = 𝐵 → (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥 ∈ 𝐵 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 Ⅎwnfc 2883 ∃wrex 3070 ∃!wreu 3374 ∃*wrmo 3375 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-tru 1544 df-ex 1782 df-nf 1786 df-mo 2534 df-eu 2563 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |