Theorem rmoeq1f 2702

Description: Equality theorem for restricted at-most-one 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 2357	. . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		eleq2 2270	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
5	4	anbi1d 465	. . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐵 ∧ 𝜑)))
6	3, 5	mobid 2090	. 2 ⊢ (𝐴 = 𝐵 → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)))
7		df-rmo 2493	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
8		df-rmo 2493	. 2 ⊢ (∃*𝑥 ∈ 𝐵 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
9	6, 7, 8	3bitr4g 223	1 ⊢ (𝐴 = 𝐵 → (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥 ∈ 𝐵 𝜑))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373  ∃*wmo 2056   ∈ wcel 2177  Ⅎwnfc 2336  ∃*wrmo 2488

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-cleq 2199  df-clel 2202  df-nfc 2338  df-rmo 2493

This theorem is referenced by:  rmoeq1  2706