| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rmoeq1f | GIF version | ||
| Description: Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by Alexander van der Vekens, 17-Jun-2017.) |
| Ref | Expression |
|---|---|
| raleq1f.1 | ⊢ Ⅎ𝑥𝐴 |
| raleq1f.2 | ⊢ Ⅎ𝑥𝐵 |
| Ref | Expression |
|---|---|
| rmoeq1f | ⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | raleq1f.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 2 | raleq1f.2 | . . . 4 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | nfeq 2226 | . . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵 |
| 4 | eleq2 2142 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 5 | 4 | anbi1d 452 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑))) |
| 6 | 3, 5 | mobid 1976 | . 2 ⊢ (𝐴 = 𝐵 → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))) |
| 7 | df-rmo 2356 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 8 | df-rmo 2356 | . 2 ⊢ (∃*𝑥 ∈ 𝐵 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)) | |
| 9 | 6, 7, 8 | 3bitr4g 221 | 1 ⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 = wceq 1284 ∈ wcel 1433 ∃*wmo 1942 Ⅎwnfc 2206 ∃*wrmo 2351 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
| This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-cleq 2074 df-clel 2077 df-nfc 2208 df-rmo 2356 |
| This theorem is referenced by: rmoeq1 2552 |
| Copyright terms: Public domain | W3C validator |