Theorem rmoi 3844

Description: Consequence of "at most one", using implicit substitution. (Contributed by NM, 4-Nov-2012.) (Revised by NM, 16-Jun-2017.)

Hypotheses

Ref	Expression
rmoi.b	⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
rmoi.c	⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜒))

Assertion

Ref	Expression
rmoi	⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓) ∧ (𝐶 ∈ 𝐴 ∧ 𝜒)) → 𝐵 = 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜓,𝑥   𝜒,𝑥

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rmoi

Step	Hyp	Ref	Expression
1		rmoi.b	. . 3 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
2		rmoi.c	. . 3 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜒))
3	1, 2	rmob 3843	. 2 ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
4	3	biimp3ar 1499	1 ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓) ∧ (𝐶 ∈ 𝐴 ∧ 𝜒)) → 𝐵 = 𝐶)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∃*wrmo 3368

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-rmo 3369  df-v 3457

This theorem is referenced by:  eqsqrtd  15415  efgred2  19818  0frgp  19844  frgpnabllem2  19939  frgpcyg  21723  prlngeq  29207  cdleme0moN  40999  proot1mul  43921