MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rmob Structured version   Visualization version   GIF version

Theorem rmob 3837
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
StepHypRef Expression
1 df-rmo 3366 . 2 (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2 simprl 783 . . . 4 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → 𝐵 ∈ 𝐴)
3 eleq1 2849 . . . 4 (𝐵 = 𝐶 → (𝐵 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
42, 3syl5ibcom 248 . . 3 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 → 𝐶 ∈ 𝐴))
5 simpl 488 . . . 4 ((𝐶 ∈ 𝐴 ∧ 𝜒) → 𝐶 ∈ 𝐴)
65a1i 11 . . 3 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → ((𝐶 ∈ 𝐴 ∧ 𝜒) → 𝐶 ∈ 𝐴))
72anim1i 627 . . . . 5 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴))
8 simpll 779 . . . . 5 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
9 simplr 781 . . . . 5 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → (𝐵 ∈ 𝐴 ∧ 𝜓))
10 eleq1 2849 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
11 rmoi.b . . . . . . 7 (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
1210, 11anbi12d 644 . . . . . 6 (𝑥 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝐵 ∈ 𝐴 ∧ 𝜓)))
13 eleq1 2849 . . . . . . 7 (𝑥 = 𝐶 → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
14 rmoi.c . . . . . . 7 (𝑥 = 𝐶 → (𝜑 ↔ 𝜒))
1513, 14anbi12d 644 . . . . . 6 (𝑥 = 𝐶 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
1612, 15mob 3675 . . . . 5 (((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
177, 8, 9, 16syl3anc 1398 . . . 4 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
1817ex 418 . . 3 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐶 ∈ 𝐴 → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒))))
194, 6, 18pm5.21ndd 382 . 2 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
201, 19sylanb 593 1 ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃*wmo 2563  ∃*wrmo 3365
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-rmo 3366  df-v 3453
This theorem is used by:  rmoi  3838  nrmod  3839
  Copyright terms: Public domain W3C validator