Theorem rmoeq1f 2504

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.)

Hypotheses

Ref	Expression
raleq1f.1	⊢ Ⅎ𝑥𝐴
raleq1f.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
rmoeq1f	⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑))

Proof of Theorem rmoeq1f

Step	Hyp	Ref	Expression
1		raleq1f.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2		raleq1f.2	. . . 4 ⊢ Ⅎ𝑥𝐵
3	1, 2	nfeq 2185	. . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		eleq2 2101	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
5	4	anbi1d 438	. . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑)))
6	3, 5	mobid 1935	. 2 ⊢ (𝐴 = 𝐵 → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)))
7		df-rmo 2314	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
8		df-rmo 2314	. 2 ⊢ (∃*𝑥 ∈ 𝐵 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
9	6, 7, 8	3bitr4g 212	1 ⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑))

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   = wceq 1243   ∈ wcel 1393  ∃*wmo 1901  Ⅎwnfc 2165  ∃*wrmo 2309

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rmo 2314

This theorem is referenced by:  rmoeq1  2508