Theorem rmob 3001

Description: Consequence of "at most one", using implicit substitution. (Contributed by NM, 2-Jan-2015.) (Revised by NM, 16-Jun-2017.)

Hypotheses

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

Assertion

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

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

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rmob

Step	Hyp	Ref	Expression
1		df-rmo 2424	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		simprl 520	. . . 4 ⊢ ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → 𝐵 ∈ 𝐴)
3		eleq1 2202	. . . 4 ⊢ (𝐵 = 𝐶 → (𝐵 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
4	2, 3	syl5ibcom 154	. . 3 ⊢ ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 → 𝐶 ∈ 𝐴))
5		simpl 108	. . . 4 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝜒) → 𝐶 ∈ 𝐴)
6	5	a1i 9	. . 3 ⊢ ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → ((𝐶 ∈ 𝐴 ∧ 𝜒) → 𝐶 ∈ 𝐴))
7		simplrl 524	. . . . 5 ⊢ (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴)
8		simpr 109	. . . . 5 ⊢ (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ 𝐴)
9		simpll 518	. . . . 5 ⊢ (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
10		simplrr 525	. . . . 5 ⊢ (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → 𝜓)
11		eleq1 2202	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
12		rmoi.b	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
13	11, 12	anbi12d 464	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝐵 ∈ 𝐴 ∧ 𝜓)))
14		eleq1 2202	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
15		rmoi.c	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜒))
16	14, 15	anbi12d 464	. . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
17	13, 16	mob 2866	. . . . 5 ⊢ (((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
18	7, 8, 9, 7, 10, 17	syl212anc 1226	. . . 4 ⊢ (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
19	18	ex 114	. . 3 ⊢ ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐶 ∈ 𝐴 → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒))))
20	4, 6, 19	pm5.21ndd 694	. 2 ⊢ ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
21	1, 20	sylanb 282	1 ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331   ∈ wcel 1480  ∃*wmo 2000  ∃*wrmo 2419

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rmo 2424  df-v 2688

This theorem is referenced by:  rmoi  3002